List edge and list total colourings of multigraphs

Total Colorings of Degenerated Graphs

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,

Coloring Algorithms on Subcubic Graphs

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics

Research problems from the 18th British combinatorial conference

Discrete Mathematics - Special issue: The 18th British combinatorial conference

Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles

Combinatorics, Probability and Computing

List Total Colourings of Graphs

Combinatorics, Probability and Computing

The edge-face choosability of plane graphs

European Journal of Combinatorics

A relation between choosability and uniquely list colorability

Journal of Combinatorial Theory Series B

On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability

European Journal of Combinatorics

List edge and list total colorings of planar graphs without 4-cycles

Theoretical Computer Science

(2,1)-Total labelling of outerplanar graphs

Discrete Applied Mathematics

Some Results on List Total Colorings of Planar Graphs

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007

List edge and list total colorings of planar graphs without short cycles

Information Processing Letters

Edge-choosability of planar graphs without non-induced 5-cycles

Information Processing Letters

Reconfiguration of List Edge-Colorings in a Graph

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Chromatic index of graphs with no cycle with a unique chord

Theoretical Computer Science

List total colorings of series-parallel graphs

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

(Δ+1)-total-colorability of plane graphs with maximum degree Δ at least 6 and without adjacent short cycles

Information Processing Letters

On the total choosability of planar graphs and of sparse graphs

Information Processing Letters

Note: Total choosability of planar graphs with maximum degree 4

Discrete Applied Mathematics

The Local Nature of List Colorings for Graphs of High Girth

SIAM Journal on Computing

Note: A structural theorem for planar graphs with some applications

Discrete Applied Mathematics

(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle

Information Processing Letters

An improved sufficient condition for reconfiguration of list edge-colorings in a tree

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation

Total coloring of planar graphs with maximum degree 7

Information Processing Letters

Entire colouring of plane graphs

Journal of Combinatorial Theory Series B

Survey: Randomly colouring graphs (a combinatorial view)

Computer Science Review

Reconfiguration of list edge-colorings in a graph

Discrete Applied Mathematics

Nonblocker in h-minor free graphs: kernelization meets discharging

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation

L(2,1)-labelings of the edge-path-replacement of a graph

Journal of Combinatorial Optimization

Every triangle-free induced subgraph of the triangular lattice is (5m,2 m)-choosable

Discrete Applied Mathematics

L(d,1)-labelings of the edge-path-replacement of a graph

Journal of Combinatorial Optimization