On the existence of k-partite or K_p-free total domination edge-critical graphs
DOI10.1016/J.DISC.2010.07.018zbMATH Open1222.05198OpenAlexW2018970627MaRDI QIDQ539864FDOQ539864
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
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- A note on Ramsey numbers
- Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- On diameter 2-critical graphs
- On diameter critical graphs
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- The maximum number of edges in a minimal graph of diameter 2
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
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)