✦ LIBER ✦

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

✍ Scribed by Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe; Anders Yeo

Book ID: 111712854
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 304 KB
Volume: 311
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.07.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the existence problem of the total do

On the existence problem of the total domination vertex critical graphs

✍ Moo Young Sohn; Dongseok Kim; Young Soo Kwon; Jaeun Lee 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 259 KB

Tight upper bound on the number of edges

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

✍ Zhi-Zhong Chen; Shiqing Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

We show that an n-vertex bipartite K 3,3 -free graph with n 3 has at most 2n -4 edges and that an n-vertex bipartite K 5 -free graph with n 5 has at most 3n -9 edges. These bounds are also tight. We then use the bound on the number of edges in a K 3,3 -free graph to extend two known NC algorithms fo