Well-covered triangulations. IV

DOI10.1016/J.DAM.2016.06.030MaRDI QIDQ323041zbMATHOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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)

Recommendations

• On well-covered triangulations. III
• On well-covered triangulations. II.
• On well-covered triangulations. I
• On well-covered quadrangulations
• scientific article; zbMATH DE number 2548

Cites work

• scientific article; zbMATH DE number 434906 (Why is no real title available?)
• scientific article; zbMATH DE number 3614795 (Why is no real title available?)
• scientific article; zbMATH DE number 1286748 (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
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Complexity results for well‐covered graphs
• Local Structure When All Maximal Independent Sets Have Equal Weight
• Modeling \(k\)-coteries by well-covered graphs
• On maximal independent sets of vertices in claw-free graphs
• On well-covered triangulations. I
• On well-covered triangulations. II.
• On well-covered triangulations. III
• Recognizing Greedy Structures
• 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

Cited in

(8)

• On well-covered direct products
• On well-covered triangulations. I
• On well-covered triangulations. II.
• On well-covered triangulations. III
• On the structure of 4-regular planar well-covered graphs
• On well-covered pentagonalizations of the plane
• Constructions for well-covered graphs
• Well-hued graphs

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)