The domatic number of block-cactus graphs

DOI10.1016/S0012-365X(97)00234-3zbMath0957.05084MaRDI QIDQ1584305

Lutz Volkmann, Dieter Rautenbach

Publication date: 2 November 2000

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

zbMATH Keywords

dominating setdomatic numberdomatically full block-cactus graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Enumerations, forbidden subgraph characterizations, and the split-decomposition

Cites Work

• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• Characterizations of strongly chordal graphs
• The domatic number problem on some perfect graph families
• Towards a theory of domination in graphs

This page was built for publication: The domatic number of block-cactus graphs