Well-covered triangulations. IV

DOI10.1016/j.dam.2016.06.030zbMath1346.05214OpenAlexW2483716866MaRDI QIDQ323041

Bert L. Hartnell, Arthur S. Finbow, Richard 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

zbMATH Keywords

maximal independent setwell-covered graph3-connected well-covered triangulation

Mathematics Subject Classification ID

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

Related Items (5)

Well-hued graphs ⋮ On the structure of 4-regular planar well-covered graphs ⋮ On well-covered pentagonalizations of the plane ⋮ Unnamed Item ⋮ On well-covered direct products

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• ModelingK-coteries by well-covered 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
• Recognizing Greedy Structures
• Reducibility among Combinatorial Problems
• Some covering concepts in graphs

This page was built for publication: Well-covered triangulations. IV