The structure of well-covered graphs with no cycles of length 4

DOI10.1016/j.disc.2006.10.011zbMath1127.05068OpenAlexW1997658699MaRDI QIDQ2643318

Jason I. Brown, Richard J. Nowakowski, Igor Edm. Zverovich

Publication date: 23 August 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.10.011

zbMATH Keywords

independent setvector spacewell-covered graph\(C_4\)-free graphforbidden co-stable subgraphwell-covered weighting

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (15)

Well-dominated graphs without cycles of lengths 4 and 5 ⋮ Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 ⋮ Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Well-covered graphs with constraints on \(\Delta\) and \(\delta\) ⋮ Graphs vertex-partitionable into strong cliques ⋮ On relating edges in graphs without cycles of length 4 ⋮ Vertex-transitive CIS graphs ⋮ Weighted well-covered claw-free graphs ⋮ Complexity results for generating subgraphs ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 ⋮ Recognizing Generating Subgraphs Revisited ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6 ⋮ Partitions and well-coveredness: the graph sandwich problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of well covered graphs of girth 5 or greater
• Well-covered graphs and extendability
• The structure of well-covered graphs and the complexity of their recognition problems
• A characterization of well-covered graphs in terms of forbidden costable subgraphs
• Complexity results for well‐covered graphs
• Local Structure When All Maximal Independent Sets Have Equal Weight
• WELL-COVERED GRAPHS: A SURVEY
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Well-Covered Vector Spaces of Graphs
• Some covering concepts in graphs

This page was built for publication: The structure of well-covered graphs with no cycles of length 4