✦ LIBER ✦

Characterizing degree-sum maximal nonhamiltonian bipartite graphs

✍ Scribed by Michael Ferrara; Michael Jacobson; Jeffrey Powell

Book ID: 113567432
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 191 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.08.029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nonhamiltonian 2-connected claw-free gra

Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum

✍ Wacław Frydrych 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Sum Coloring of Bipartite Graphs with Bo

Sum Coloring of Bipartite Graphs with Bounded Degree

✍ Michal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 580 KB

Degree Sum Conditions for Cyclability in

Degree Sum Conditions for Cyclability in Bipartite Graphs

✍ Haruko Okamura, Tomoki Yamashita 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 215 KB

All nonhamiltonian tough graphs satisfyi

All nonhamiltonian tough graphs satisfying a 3-degree sum and fan-type conditions

✍ W. Frydrych 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 819 KB

Frydrych, W., All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions, Discrete Mathematics 121 (1993) 93-104. It is shown that if G is a l-tough nonhamiltonian graph on even number vertices n>4 such that d(x)+d(y)+d(z)>n for every triple of mutually distinct and nonadjace

Enumerating maximal bicliques in biparti

Enumerating maximal bicliques in bipartite graphs with favorable degree sequences

✍ Damaschke, Peter 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 187 KB