Total domination in 2-connected graphs and in graphs with no induced 6-cycles

DOI10.1002/jgt.20345zbMath1189.05131MaRDI QIDQ3605160

Anders Yeo, Michael A. Henning

Publication date: 20 February 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20345

zbMATH Keywords

bounds; transversals; total domination; 2-connected; \(C_{6}\)-free

Mathematics Subject Classification ID

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

Related Items

Total transversals and total domination in uniform hypergraphs, Transversals and domination in uniform hypergraphs, Dominating and total dominating partitions in cubic graphs, Perfect matchings in total domination critical graphs, A survey of selected recent results on total domination in graphs, Total domination in planar graphs of diameter two, An improved upper bound on the total restrained domination number in cubic graphs, Girth and total domination in graphs, Linear hypergraphs with large transversal number and maximum degree two, Equality in a linear Vizing-like relation that relates the size and total domination number of a graph, 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new upper bound on the total domination number of a graph
• Covering all cliques of a graph
• Small transversals in hypergraphs
• Restricted domination in graphs
• Restricted total domination in graphs
• Transversal numbers of uniform hypergraphs
• Relating the size of a connected graph to its total and restricted domination numbers
• Restricted domination parameters in graphs
• Total domination in graphs
• Some remarks on domination