Graph Transformations Preserving the Stability Number - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2009

Graph Transformations Preserving the Stability Number

Abstract

We analyse the relations between several graph transformations that were introduced to be used in procedures determining the stability number of a graph. We show that all these transformations can be decomposed into a sequence of edge deletions and twin deletions. We also show how some of these transformations are related to the notion of even pair introduced to color some classes of perfect graphs. Then, some properties of edge deletion and twin deletion are given and a conjecture is formulated about the class of graphs for which these transformations can be used to determine the stability number.
No file

Dates and versions

lirmm-00620722 , version 1 (08-09-2011)

Identifiers

  • HAL Id : lirmm-00620722 , version 1

Cite

Benjamin Lévêque, Dominique de Werra. Graph Transformations Preserving the Stability Number. LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Gramado, Brazil. pp.3-8. ⟨lirmm-00620722⟩
107 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More