✦ LIBER ✦

Graphs of degree 4 are 5-edge-choosable

✍ Scribed by Juvan, Martin; Mohar, Bojan; ??krekovski, Riste

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 312 KB
Volume: 32
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199911)32:3<250::aid-jgt5>3.0.co;2-r

No coin nor oath required. For personal study only.

✦ Synopsis

It is shown that every simple graph with maximal degree 4 is 5-edgechoosable.

📜 SIMILAR VOLUMES

Choosability, Edge Choosability, and Tot

Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs

✍ Wang Weifan; Ko-Wei Lih 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Let χ l (G), χ l (G), χ l (G), and (G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. ( 1 and only if G is an odd cycle. This proves the

Planar graphs without 4-cycles are acycl

Planar graphs without 4-cycles are acyclically 6-choosable

✍ Weifan Wang; Min Chen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## Abstract A proper vertex coloring of a graph __G__=(__V, E__) is acyclic if __G__ contains no bicolored cycle. A graph __G__ is acyclically __L__‐list colorable if for a given list assignment __L__={__L__(__v__)|__v__∈__V__}, there exists a proper acyclic coloring π of __G__ such that π(__v__)∈_

Improper choosability of graphs and maxi

Improper choosability of graphs and maximum average degree

✍ Frédéric Havet; Jean-Sébastien Sereni 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB

## Abstract Improper choosability of planar graphs has been widely studied. In particular, Škrekovski investigated the smallest integer __g__~k~ such that every planar graph of girth at least __g__~k~ is __k__‐improper 2‐choosable. He proved [9] that 6 ≤ __g__~1~ ≤ 9; 5 ≤ __g__~2~ ≤ 7; 5 ≤ __g__~3

Acyclic edge coloring of graphs with max

Acyclic edge coloring of graphs with maximum degree 4

✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

## Abstract An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__′(__G__). It was conj

Light subgraphs in planar graphs of mini

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9

✍ B. Mohar; R. Škrekovski; H.-J. Voss 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 326 KB 👁 1 views

## Abstract A graph __H__ is light in a given class of graphs if there is a constant __w__ such that every graph of the class which has a subgraph isomorphic to __H__ also has a subgraph isomorphic to __H__ whose sum of degrees in __G__ is ≤ __w__. Let $\cal G$ be the class of simple planar graphs

Defective choosability of graphs with no

Defective choosability of graphs with no edge-plus-independent-set minor

✍ Douglas R. Woodall 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB

## Abstract It is proved that, if __s__ ≥ 2, a graph that does not have __K__~2~ + __K__~__s__~ = __K__~1~ + __K__~1, __s__~ as a minor is (__s__, 1)\*‐choosable. This completes the proof that such a graph is (__s__ + 1 − __d__,__d__)\*‐choosable whenever 0 ≤ __d__ ≤ __s__ −1 © 2003 Wiley Periodica