After a brief historical account, a few simple structural theorems about plane graphs useful
for coloring are stated, and two simple applications of discharging are given. Afterwards, the …

We provide a “how-to” guide to the use and application of the Discharging Method. Our aim
is not to exhaustively survey results proved by this technique, but rather to demystify the …

It is known that the acyclic chromatic number of a subcubic graph is at most four, and its
acyclic edge chromatic number is at most five. We present algorithms that prove these two …

A\emph (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total
order of each vertex colour class, and a (non-proper) edge k-colouring such that between …

Acyclic, Star and Oriented Colourings of Graph Subdivisions Page 1 Discrete Mathematics
and Theoretical Computer Science 7, 2005, 37–50 Acyclic, Star and Oriented Colourings of …

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 …

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 …

A proper vertex coloring of a graph G=(V, E) is acyclic if G contains no bicolored cycle. A
graph G is L‐list colorable if for a given list assignment L={L (v): v∈ V}, there exists a proper …

Every planar graph is known to be acyclically 7‐choosable and is conjectured to be
acyclically 5‐choosable (OV Borodin, DG Fon‐Der‐Flaass, AV Kostochka, E. Sopena, J …

A proper vertex coloring of a non-oriented graph G is linear if the graph induced by the
vertices of any two color classes is a forest of paths. A graph G is linearly L-list colorable if for …