Domination graphs: Examples and counterexamples

DOI10.1016/S0166-218X(00)00274-2zbMath0982.05074OpenAlexW2042437241WikidataQ124963786 ScholiaQ124963786MaRDI QIDQ5936465

Jeremy P. Spinrad, Irena Rusu

Publication date: 8 April 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00274-2

zbMATH Keywords

domination graphgeneralized join decomposabilitytolerance graphstrapezoid graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Tolerance graphs
• Weakly triangulated graphs
• Completely separable graphs
• Decomposition of perfect graphs
• Forbidden subgraph decomposition
• Proper and unit tolerance graphs
• Decomposition of Directed Graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Transitiv orientierbare Graphen
• Partially Ordered Sets

This page was built for publication: Domination graphs: Examples and counterexamples