✦ LIBER ✦

Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs

✍ Scribed by František Kardoš; Daniel Král′; Jan Volec

Book ID: 115561930
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 334 KB
Volume: 41
Category: Article
ISSN: 1042-9832
DOI: 10.1002/rsa.20471

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cubic Graphs with Large Girth

✍ N. L. BIGGS 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 297 KB

Domination number of cubic graphs with l

Domination number of cubic graphs with large girth

✍ Daniel Král'; Petr Škoda; Jan Volec 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n / g) < 3n / 10+O(n / g) This research was done when the Petr Škoda was a student of

Fractional colorings of cubic graphs wit

Fractional colorings of cubic graphs with large girth

✍ Kardoš, František; Král’, Daniel; Volec, Jan 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 242 KB

Edges in graphs with large girth

✍ R. D. Dutton; R. C. Brigham 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 365 KB

On the maximum number of independent edg

On the maximum number of independent edges in cubic graphs

✍ Arthur M. Hobbs; Edward Schmeichel 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Let the reals be extended to include oo with o~ > r

Cops and robbers in graphs with large gi

Cops and robbers in graphs with large girth and Cayley graphs

✍ Peter Frankl 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 243 KB