Well-covered triangulations. IV
DOI10.1016/J.DAM.2016.06.030zbMATH Open1346.05214OpenAlexW2483716866MaRDI QIDQ323041FDOQ323041
Authors: Arthur S. Finbow, Bert L. Hartnell, R. J. Nowakowski, Michael D. Plummer
Publication date: 7 October 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.06.030
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
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é
- Modeling \(k\)-coteries by well-covered graphs
- On maximal independent sets of vertices in claw-free graphs
- Well-covered claw-free graphs
- Title not available (Why is that?)
- Recognizing Greedy Structures
- Title not available (Why is that?)
- The structure of well-covered graphs and the complexity of their recognition problems
- On well-covered triangulations. I
- 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
Cited In (8)
This page was built for publication: Well-covered triangulations. IV
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323041)