Weighted well-covered graphs without C₄, C₅, C₆, C₇

DOI10.1016/J.DAM.2010.11.009MaRDI QIDQ628320zbMATH OpenOpenAlexFDO

Authors Vadim E. Levit, David Tankus

Publication date 10 March 2011

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

Full work available at URL https://doi.org/10.1016/j.dam.2010.11.009

zbMATH Keywords

independent setwell-covered graphhereditary systemgenerating subgraphrelating edge

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Well-covered graphs without cycles of lengths 4, 5 and 6
• The structure of well-covered graphs with no cycles of length 4
• On related edges in well-covered graphs without cycles of length 4 and 6
• Well-dominated graphs without cycles of lengths 4 and 5
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles

Cites work

• scientific article; zbMATH DE number 434906 (Why is no real title available?)
• A characterization of the 1-well-covered graphs with no 4-cycles
• A characterization of well covered graphs of girth 5 or greater
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Complexity results for well‐covered graphs
• Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
• Local Structure When All Maximal Independent Sets Have Equal Weight
• On related edges in well-covered graphs without cycles of length 4 and 6
• Recognizing Greedy Structures
• The structure of well-covered graphs and the complexity of their recognition problems
• The structure of well-covered graphs with no cycles of length 4
• Well covered simplicial, chordal, and circular arc graphs
• Well-covered claw-free graphs
• Well-covered graphs and extendability

Cited in

(11)

• The structure of well-covered graphs with no cycles of length 4
• Well-covered graphs without cycles of lengths 4, 5 and 6
• On related edges in well-covered graphs without cycles of length 4 and 6
• Complexity results for generating subgraphs
• Well-covered graphs with constraints on \(\Delta\) and \(\delta\)
• Well-dominated graphs without cycles of lengths 4 and 5
• Weighted well-covered claw-free graphs
• Weighted well-covered graphs without cycles of lengths 5, 6 and 7
• Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7
• scientific article; zbMATH DE number 2148180 (Why is no real title available?)
• Recognizing generating subgraphs revisited

This page was built for publication: Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628320)