Planar domination graphs

DOI10.1016/S0012-365X(02)00684-2MaRDI QIDQ1398259zbMATH OpenOpenAlexFDO

Authors Elaine M. Eschen, William F. Klostermeyer, R. Sritharan

Publication date 29 July 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00684-2

zbMATH Keywords

domination graphplanar graphrecognition algorithmweakly chordal graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Domination numbers of planar graphs
• Domination graphs: Examples and counterexamples
• scientific article; zbMATH DE number 2188424
• Domination in planar graphs with small diameter*
• Perfect graphs of strong domination and independent strong domination

Cited in

(3)

• A characterization of domination reducible graphs
• scientific article; zbMATH DE number 6000734 (Why is no real title available?)
• Domination graphs: Examples and counterexamples

This page was built for publication: Planar domination graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398259)