Local transformations of graphs preserving independence number
From MaRDI portal
Publication:4242792
DOI10.1016/S0166-218X(02)00291-3zbMath0913.05057OpenAlexW2037158737MaRDI QIDQ4242792
Vadim V. Lozin, Vladimir E. Alekseev
Publication date: 11 May 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00291-3
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A method of graph reduction and its applications ⋮ Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs ⋮ Stability preserving transformations of graphs ⋮ On finding augmenting graphs ⋮ Graph transformations preserving the stability number ⋮ On the maximum independent set problem in graphs of bounded maximum degree ⋮ Stability in \(P_5\)- and banner-free graphs ⋮ On the stable set problem in special \(P_{5}\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Stability in CAN-free graphs
- The struction of a graph: Application to CN-free graphs
- On maximal independent sets of vertices in claw-free graphs
- The struction algorithm for the maximum stable set problem revisited
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Stability in circular arc graphs
