𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fractional colorings of cubic graphs with large girth

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


Book ID
118197151
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
242 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


UniquelyH-colorable graphs with large gi
✍ Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 2 views

Suppose G and H are graphs. We say G is H-colorable if there is a homomorphism (edge-preserving vertex mapping) from G to H. We say a graph G is uniquely H-colorable if there is an onto homomorphism c from G to H, and any other homomorphism from G to H is the composition o o c of c with an automorph

Domination number of cubic graphs with l
✍ 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