✦ LIBER ✦

Chromatic number and skewness

✍ Scribed by Paul C Kainen

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 156 KB
Volume: 18
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(75)90059-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic number of skew graphs

✍ Herbert Pahlings 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Circular Chromatic Numbers and Fractiona

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs

✍ G.J. Chang; L. Huang; X. Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for

Star chromatic number

✍ A. Vince 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB

Edge-face chromatic number and edge chro

Edge-face chromatic number and edge chromatic number of simple plane graphs

✍ Rong Luo; Cun-Quan Zhang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

## Abstract Given a simple plane graph __G__, an edge‐face __k__‐coloring of __G__ is a function ϕ : __E__(__G__) ∪ __F__(G) → {1,…,__k__} such that, for any two adjacent or incident elements __a__, __b__ ∈ __E__(__G__) ∪ __F__(__G__), ϕ(__a__) ≠ ϕ(__b__). Let χ~e~(__G__), χ~ef~(__G__), and Δ(__G_

Induced Cycles and Chromatic Number

✍ A.D. Scott 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

We prove that, for any pair of integers k, l 1, there exists an integer N(k, l ) such that every graph with chromatic number at least N(k, l ) contains either K k or an induced odd cycle of length at least 5 or an induced cycle of length at least l.

Subgraphs of large connectivity and chro

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.