Total domination in partitioned graphs

DOI10.1007/s00373-008-0839-zzbMath1211.05111OpenAlexW1986408626MaRDI QIDQ1043811

Allan Frendrup, Preben Dahl Vestergaard, Anders Yeo

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0839-z

zbMATH Keywords

total dominationpartitions and hypergraphs

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 (3)

On the ratio between 2-domination and total outer-independent domination numbers of trees ⋮ Tight lower bounds on the size of a maximum matching in a regular graph ⋮ Affine planes and transversals in 3-uniform linear hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination in partitioned graphs with minimum degree two
• Total domination in partitioned trees and partitioned graphs with minimum degree two
• Total domination of graphs and small transversals of hypergraphs
• A survey of selected recent results on total domination in graphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• Tight lower bounds on the size of a maximum matching in a regular graph
• On matching and total domination in graphs
• Relationships between total domination, order, size, and maximum degree of graphs
• Hypergraphs with large transversal number and with edge sizes at least 3
• Graphs with large total domination number
• Domination in partitioned graphs

This page was built for publication: Total domination in partitioned graphs