✦ LIBER ✦

Total domination and the Caccetta–Häggkvist conjecture

✍ Scribed by Patrick St-Louis; Bernard Gendron; Alain Hertz

Book ID: 119227576
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 283 KB
Volume: 9
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2012.07.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Caccetta–Häggkvist Conjecture

✍ Jian Shen 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 118 KB

On the Caccetta-Häggkvist Conjecture wit

On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs

✍ Razborov, Alexander A. 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 561 KB

Counting subgraphs a new approach to the

Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture

✍ J.A. Bondy 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 552 KB

Proof of the Caccetta–Häggkvist conjectu

Proof of the Caccetta–Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two

✍ Lichiardopol, Nicolas 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Proof of a conjecture of Häggkvist on cy

Proof of a conjecture of Häggkvist on cycles and independent edges

✍ Kenneth A. Berman 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 196 KB

A graph G of order n is a ck-graph if for every pair of d~tinct, nonadlacenl veJtlces x and y' d(x)+d(y)>~n+k where d(v) denotes the degree of a vertex v In this paper, we prove the

A new lower bound for the total dominati

A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture

✍ Henning, Michael A.; Yeo, Anders 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 395 KB