A characterization of Zm-well-covered graphs of girth 6 or more

DOI<246::AID-JGT6>3.0.CO;2-6 10.1002/(SICI)1097-0118(200004)33:4<246::AID-JGT6>3.0.CO;2-6zbMath0944.05084OpenAlexW4239278647MaRDI QIDQ4948753

Yair Caro, Bert L. Hartnell

Publication date: 15 September 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200004)33:4<246::aid-jgt6>3.0.co;2-6

zbMATH Keywords

well-coveredmaximal independent setmagic well-covered

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The uniformity space of hypergraphs and its applications

Cites Work

• Generalizations of magic graphs
• Magic graphs, a characterization
• A characterization of well covered graphs of girth 5 or greater
• On the complexity of some two-person perfect-information games
• Very well covered graphs
• Complexity results for well‐covered graphs
• On some subclasses of well-covered graphs
• Local Structure When All Maximal Independent Sets Have Equal Weight
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Subdivisions, parity and well-covered graphs
• Recognizing Greedy Structures
• Some covering concepts in graphs