𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sparse graphs of girth at least five are packable

✍ Scribed by Agnieszka Görlich; Andrzej Żak

Book ID
119227547
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
245 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposing graphs with girth at least f
Decomposing graphs with girth at least five under degree constraints
✍ Diwan, Ajit A. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 2 views

We prove that the vertex set of a simple graph with minimum degree at least s + t -1 and girth at least 5 can be decomposed into two parts, which induce subgraphs with minimum degree at least s and t, respectively, where s, t are positive integers ≥ 2.

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