On well-covered triangulations. III

DOI10.1016/j.dam.2009.08.002zbMath1209.05167OpenAlexW4205716054WikidataQ55877988 ScholiaQ55877988MaRDI QIDQ972324

Richard J. Nowakowski, Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer

Publication date: 25 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.08.002

zbMATH Keywords

maximal independent setwell-covered graph4-connected planar triangulation

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

Well-covered triangulations. IV ⋮ Graphs with maximal induced matchings of the same size ⋮ Well-hued graphs ⋮ On the structure of 4-regular planar well-covered graphs ⋮ Vertex-transitive CIS graphs ⋮ Triangulations and equality in the domination chain ⋮ On well-covered pentagonalizations of the plane ⋮ Unnamed Item ⋮ On well-covered direct products

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On well-covered triangulations. II.
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Triangles with restricted degrees of their boundary vertices in plane triangulations
• Triangles with restricted degree sum of their boundary vertices in plane graphs
• 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
• WELL-COVERED GRAPHS: A SURVEY
• Some covering concepts in graphs

This page was built for publication: On well-covered triangulations. III