On the structure of 4-regular planar well-covered graphs

DOI10.1016/J.DAM.2020.03.003MaRDI QIDQ2192121zbMATH OpenOpenAlexFDO

Authors Arthur S. Finbow, Michael D. Plummer, Bert L. Hartnell

Publication date 29 June 2020

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

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

zbMATH Keywords

well-coveredindependent setplanar graph4-regular

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 436079
• The structure of well-covered graphs with no cycles of length 4
• A class of planar well‐covered graphs with girth four
• scientific article; zbMATH DE number 1409193
• On well-covered quadrangulations

Cites work

• scientific article; zbMATH DE number 434906 (Why is no real title available?)
• scientific article; zbMATH DE number 1286748 (Why is no real title available?)
• scientific article; zbMATH DE number 2068161 (Why is no real title available?)
• scientific article; zbMATH DE number 205349 (Why is no real title available?)
• scientific article; zbMATH DE number 2548 (Why is no real title available?)
• A characterization of well covered graphs of girth 5 or greater
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Complexity results for well‐covered graphs
• Graph theory with applications
• Local Structure When All Maximal Independent Sets Have Equal Weight
• On 4-connected claw-free well-covered graphs
• On maximal independent sets of vertices in claw-free graphs
• On well-covered quadrangulations
• On well-covered triangulations. I
• On well-covered triangulations. II.
• On well-covered triangulations. III
• Reducibility among combinatorial problems
• Some covering concepts in graphs
• The structure of well-covered graphs and the complexity of their recognition problems
• WELL-COVERED GRAPHS: A SURVEY
• Well-covered claw-free graphs
• Well-covered triangulations. IV

Cited in

(8)

• scientific article; zbMATH DE number 436079 (Why is no real title available?)
• Recognizing well covered graphs of families with special \(P _{4}\)-components
• 4-critical 4-valent planar graphs constructed with crowns.
• \(s\)-regular dihedral coverings of the complete graph of order 4
• scientific article; zbMATH DE number 1409193 (Why is no real title available?)
• A class of planar well‐covered graphs with girth four
• 1-well-covered graphs containing a clique of size \(n/3\)
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs

This page was built for publication: On the structure of 4-regular planar well-covered graphs

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