A revision and extension of results on 4-regular, 4-connected, claw-free graphs

DOI10.1016/J.DAM.2011.04.013MaRDI QIDQ2275929zbMATH OpenOpenAlexFDO

Authors Trevor J. jun. Gionet, Erika L. C. King, Yixiao Sha

Publication date 10 August 2011

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

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

zbMATH Keywords

4-connected4-regularclaw-freewell-coveredwell-dominated

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• On 4-connected claw-free well-covered graphs
• Power domination in regular claw-free graphs
• On the structure of 4-regular planar well-covered graphs
• Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
• Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)

Cites work

• scientific article; zbMATH DE number 4063149 (Why is no real title available?)
• scientific article; zbMATH DE number 1286748 (Why is no real title available?)
• scientific article; zbMATH DE number 2141600 (Why is no real title available?)
• scientific article; zbMATH DE number 2548 (Why is no real title available?)
• scientific article; zbMATH DE number 861329 (Why is no real title available?)
• On 4-connected claw-free well-covered graphs
• WELL-COVERED GRAPHS: A SURVEY

Cited in

(14)

• On 4-connected claw-free well-covered graphs
• The independence number of connected (claw, K₄)-free 4-regular graphs
• On well-dominated direct, Cartesian and strong product graphs
• (C₃, C₄, C₅, C₇)-free almost well-dominated graphs
• On the structure of graphs without claw, \(4K_1\) and co-R
• On the structure of 4-regular planar well-covered graphs
• On well-dominated graphs
• On quadrilaterals and 4-path in claw-free graphs
• Well-totally-dominated graphs
• On the geometricity of distance-regular graphs without 4-claws
• Some results on the reconstruction problems. p‐claw‐free, chordal, and p₄‐reducible graphs
• Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
• Clique-transversal sets in 4-regular claw-free graphs
• Recognizing well-dominated graphs is coNP-complete

This page was built for publication: A revision and extension of results on 4-regular, 4-connected, claw-free graphs

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