✦ LIBER ✦

Gallai's Conjecture For Graphs of Girth at Least Four

✍ Scribed by Harding, Peter; McGuinness, Sean

Book ID: 120936354
Publisher: John Wiley and Sons
Year: 2013
Tongue: English
Weight: 762 KB
Volume: 75
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21735

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparse graphs of girth at least five are

Sparse graphs of girth at least five are packable

✍ Agnieszka Görlich; Andrzej Żak 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 245 KB

The Erdős-Sós conjecture for graphs of g

The Erdős-Sós conjecture for graphs of girth 5

✍ Stephan Brandt; Edward Dobson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 167 KB

On 3-choosable planar graphs of girth at

On 3-choosable planar graphs of girth at least 4

✍ Xiangwen Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Group chromatic number of planar graphs

Group chromatic number of planar graphs of girth at least 4

✍ Hong-Jian Lai; Xiangwen Li 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB 👁 1 views

## Abstract Jeager et al. introduced a concept of group connectivity as a generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5‐edge connected graph is Z~3~‐connected. For planar graphs, this is equivalent to that every planar graph with girth at lea

Acyclic Chromatic Indices of Planar Grap

Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4

✍ Qiaojun Shu; Weifan Wang; Yiqiao Wang 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 656 KB

The Domination Number of Cubic Graphs wi

The Domination Number of Cubic Graphs with Girth at least Five

✍ David C. Fisher; Kathryn Fraughnaugh; Suzanne M. Seager 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 356 KB