Article

Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable

LaBRI, Université Bordeaux I, Talence, France; LaBRI, Université Bordeaux I, Talence, France
Discrete Applied Mathematics (Impact Factor: 0.72). 01/2009; DOI: 10.1016/j.endm.2009.07.111
Source: DBLP

ABSTRACT In this paper, we prove that planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable.

0 Bookmarks
 · 
35 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A tree-coloring of a maximal planar graph is a proper vertex $4$-coloring such that every bichromatic subgraph, induced by this coloring, is a tree. A maximal planar graph $G$ is tree-colorable if $G$ has a tree-coloring. In this article, we prove that a tree-colorable maximal planar graph $G$ with $\delta(G)\geq 4$ contains at least four odd-vertices. Moreover, for a tree-colorable maximal planar graph of minimum degree 4 that contains exactly four odd-vertices, we show that the subgraph induced by its four odd-vertices is not a claw and contains no triangles.
    03/2014;
  • [Show abstract] [Hide abstract]
    ABSTRACT: A proper vertex coloring of a graph G is acyclic if G contains no bicolored cycles. Given a list assignment L = {L(v) | v ∈ V} of G, we say that G is acyclically L-colorable if there exists a proper acyclic coloring π of G such that π(v) ∈ L(v) for all v ∈ V. If G is acyclically L-colorable for any list assignment L with |L(v)| ⩾ k for all v ∈ V (G), then G is acyclically k-choosable. In this paper, we prove that every planar graph G is acyclically 6-choosable if G does not contain 4-cycles adjacent to i-cycles for each i ∈ {3, 4, 5, 6}. This improves the result by Wang and Chen (2009).
    Science China Mathematics 12/2013; · 0.50 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We provide a "how-to" guide to the use and application of the Discharging Method. Our aim is not to exhaustively survey results that have been proved by this technique, but rather to demystify the technique and facilitate its wider use. Along the way, we present some new proofs and new problems.
    06/2013;