On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs

DOI10.1016/j.disc.2010.07.018zbMath1222.05198OpenAlexW2018970627MaRDI QIDQ539864

Michael A. Henning, Teresa W. Haynes, Anders Yeo, Lucas C. Van Der Merwe

Publication date: 31 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.07.018

zbMATH Keywords

multipartite graphdiameter criticaltotal domination edge-critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Some results on the independence number of connected domination critical graphs ⋮ Perfect matchings in total domination critical graphs ⋮ Total edge critical graphs with leaves

Cites Work

• A survey of selected recent results on total domination in graphs
• On diameter 2-critical graphs
• On diameter critical graphs
• A note on Ramsey numbers
• On a conjecture of Murty and Simon on diameter 2-critical graphs
• Total domination in graphs
• The maximum number of edges in a minimal graph of diameter 2
• Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs