On well-covered triangulations. II.

DOI10.1016/J.DAM.2009.03.014zbMath1209.05166OpenAlexW2138177131MaRDI QIDQ967322

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

Publication date: 28 April 2010

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

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

zbMATH Keywords

planar triangulationwell-covered graphindependent domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) 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 ⋮ 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 ⋮ On well-covered triangulations. III ⋮ Unnamed Item ⋮ On well-covered direct products

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The uniquely embeddable planar graphs
• Complexity results for well‐covered graphs
• WELL-COVERED GRAPHS: A SURVEY
• Some covering concepts in graphs
• How to Draw a Graph

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