A new property of critical imperfect graphs and some consequences
European Journal of Combinatorics
Stability in circular arc graphs
Journal of Algorithms
Journal of Combinatorial Theory Series B
On the use of Boolean methods for the computation of the stability number
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Dirac-type characterizations of graphs without long chordless cycles
Discrete Mathematics
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Local transformations of graphs preserving independence number
Discrete Applied Mathematics
A class of perfectly contractile graphs
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Theoretical Computer Science
A Magnetic Procedure for the Stability Number
Graphs and Combinatorics
Hi-index | 0.04 |
We analyze 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.