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

DOI10.1016/J.DISC.2010.07.018MaRDI QIDQ539864zbMATH OpenOpenAlexFDO

Authors Teresa W. Haynes, Michael A. Henning, A. Yeo, Lucas 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)

Recommendations

• scientific article; zbMATH DE number 1248191
• A note on total domination edge critical graphs
• scientific article; zbMATH DE number 2188442
• scientific article; zbMATH DE number 2197907
• The existence problem of \(k\mathrm{-}\gamma_t\)-critical graphs

Cites work

• scientific article; zbMATH DE number 3908467 (Why is no real title available?)
• scientific article; zbMATH DE number 3497930 (Why is no real title available?)
• scientific article; zbMATH DE number 1248191 (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 2024676 (Why is no real title available?)
• scientific article; zbMATH DE number 1472188 (Why is no real title available?)
• scientific article; zbMATH DE number 3013308 (Why is no real title available?)
• A note on Ramsey numbers
• A survey of selected recent results on total domination in graphs
• On a conjecture of Murty and Simon on diameter 2-critical graphs
• On diameter 2-critical graphs
• On diameter critical graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The maximum number of edges in a minimal graph of diameter 2
• Total domination in graphs
• Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers

Cited in

(3)

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

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

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