On the structure of 4-regular planar well-covered graphs
From MaRDI portal
Publication:2192121
DOI10.1016/J.DAM.2020.03.003zbMATH Open1442.05043OpenAlexW3011943616MaRDI QIDQ2192121FDOQ2192121
Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer
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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Reducibility among Combinatorial Problems
- A characterization of well covered graphs of girth 5 or greater
- WELL-COVERED GRAPHS: A SURVEY
- Some covering concepts in graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Title not available (Why is that?)
- On maximal independent sets of vertices in claw-free graphs
- Well-covered claw-free graphs
- Title not available (Why is that?)
- The structure of well-covered graphs and the complexity of their recognition problems
- On well-covered triangulations. I
- Well-covered triangulations. IV
- Complexity results for well‐covered graphs
- Local Structure When All Maximal Independent Sets Have Equal Weight
- Title not available (Why is that?)
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- On well-covered triangulations. II.
- On well-covered triangulations. III
- On 4-connected claw-free well-covered graphs
- A revision and extension of results on 4-regular, 4-connected, claw-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- 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
- Title not available (Why is that?)
- 1-well-covered graphs containing a clique of size \(n/3\)
- A class of planar well‐covered graphs with girth four
- Title not available (Why is that?)
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)