Total domination in partitioned graphs

DOI10.1007/S00373-008-0839-ZMaRDI QIDQ1043811zbMATH OpenOpenAlexFDO

Authors Allan Frendrup, Preben Dahl Vestergaard, A. 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

partitions and hypergraphstotal domination

Mathematics Subject Classification ID

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

Recommendations

• Total domination in partitioned trees and partitioned graphs with minimum degree two
• scientific article; zbMATH DE number 1462928
• scientific article; zbMATH DE number 2076802
• Publication:4489226
• scientific article; zbMATH DE number 6311742

Cites work

• A survey of selected recent results on total domination in graphs
• Covering all cliques of a graph
• Domination in partitioned graphs
• Domination in partitioned graphs with minimum degree two
• Graphs with large total domination number
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 2061963 (Why is no real title available?)
• scientific article; zbMATH DE number 1462928 (Why is no real title available?)
• Hypergraphs with large transversal number and with edge sizes at least 3
• On matching and total domination in graphs
• Relationships between total domination, order, size, and maximum degree of graphs
• Small transversals in hypergraphs
• Tight lower bounds on the size of a maximum matching in a regular graph
• Total domination in partitioned trees and partitioned graphs with minimum degree two
• Total domination of graphs and small transversals of hypergraphs

Cited in

(14)

• Partitioning the vertices of a cubic graph into two total dominating sets
• Affine planes and transversals in 3-uniform linear hypergraphs
• Tight lower bounds on the size of a maximum matching in a regular graph
• Partitioning a graph into a dominating set, a total dominating set, and something else
• scientific article; zbMATH DE number 4029630 (Why is no real title available?)
• On the ratio between 2-domination and total outer-independent domination numbers of trees
• scientific article; zbMATH DE number 2061963 (Why is no real title available?)
• scientific article; zbMATH DE number 1472171 (Why is no real title available?)
• scientific article; zbMATH DE number 6311742 (Why is no real title available?)
• Distance domination in vertex partitioned graphs
• Partitioning the vertices of a graph into a total dominating set and an independent dominating set.
• Acyclic dominating partitions
• NP-completeness results for partitioning a graph into total dominating sets
• Total domination in partitioned trees and partitioned graphs with minimum degree two

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

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