On well-covered pentagonalizations of the plane
From MaRDI portal
Publication:526819
DOI10.1016/J.DAM.2017.02.016zbMath1361.05095OpenAlexW2604989626MaRDI QIDQ526819
Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer
Publication date: 15 May 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.02.016
Cites Work
- Well-covered triangulations. IV
- On well-covered triangulations. II.
- On well-covered triangulations. III
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- A characterization of well covered graphs of girth 5 or greater
- The structure of well-covered graphs and the complexity of their recognition problems
- On well-covered triangulations. I
- Well-covered claw-free graphs
- Complexity results for well‐covered graphs
- Local Structure When All Maximal Independent Sets Have Equal Weight
- WELL-COVERED GRAPHS: A SURVEY
- A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
- Reducibility among Combinatorial Problems
- Some covering concepts in graphs
- The complexity of theorem-proving procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On well-covered pentagonalizations of the plane
