Local transformations of graphs preserving independence number
From MaRDI portal
Recommendations
- On local and global independence numbers of a graph
- Preservers of cover numbers and independence numbers of undirected graphs
- Publication:4505839
- Stability preserving transformations of graphs
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
Cites work
- scientific article; zbMATH DE number 3904619 (Why is no real title available?)
- scientific article; zbMATH DE number 3700235 (Why is no real title available?)
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- On maximal independent sets of vertices in claw-free graphs
- Stability in CAN-free graphs
- Stability in circular arc graphs
- The struction algorithm for the maximum stable set problem revisited
- The struction of a graph: Application to CN-free graphs
Cited in
(12)- A local independence number condition for n-extendable graphs
- Stability in \(P_5\)- and banner-free graphs
- A method of graph reduction and its applications
- On the stable set problem in special \(P_{5}\)-free graphs
- Independent transversals in locally sparse graphs
- Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
- A constructive existence theorem related to local transformations of graphs for the independent set problem
- Graph transformations preserving the stability number
- Stability preserving transformations of graphs
- Partitioning vertices of graphs into paths of the same length
- On the maximum independent set problem in graphs of bounded maximum degree
- On finding augmenting graphs
This page was built for publication: Local transformations of graphs preserving independence number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242792)
