✦ LIBER ✦

Group Chromatic Number of Graphs without K5-Minors

✍ Scribed by Hong-Jian Lai; Xiankun Zhang

Publisher: Springer Japan
Year: 2002
Tongue: English
Weight: 116 KB
Volume: 18
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730200009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Group Chromatic Number of Graphs

✍ Hong-Jian Lai; Xiangwen Li 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 102 KB

The chromatic number of graphs which ind

The chromatic number of graphs which induce neither K1,3 nor K5−e

✍ Henry A Kierstead; James H Schmerl 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 549 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

A bound on the chromatic number of graph

A bound on the chromatic number of graphs without certain induced subgraphs

✍ Stanley Wagon 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 144 KB

The chromatic number of oriented graphs

✍ Sopena, Eric 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with

Game chromatic number of outerplanar gra

Game chromatic number of outerplanar graphs

✍ Guan, D. J.; Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

This note proves that the game chromatic number of an outerplanar graph is at most 7. This improves the previous known upper bound of the game chromatic number of outerplanar graphs.