New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
From MaRDI portal
Publication:4354590
DOI10.1017/S0963548397002927zbMath0880.05035MaRDI QIDQ4354590
Jeannette C. M. Janssen, Roland Haeggkvist
Publication date: 19 January 1998
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (39)
List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ Total choosability of multicircuits II ⋮ The tournament scheduling problem with absences ⋮ On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability ⋮ List edge and list total colorings of planar graphs without 4-cycles ⋮ Edge-group choosability of outerplanar and near-outerplanar graphs ⋮ Extension from precoloured sets of edges ⋮ Edge DP-coloring in planar graphs ⋮ On the chromatic index of generalized truncations ⋮ List Ramsey numbers ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ Edge-colouring graphs with local list sizes ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ The list-chromatic index of \(K_6\) ⋮ Computing the list chromatic index of graphs ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ Edge-coloring almost bipartite multigraphs ⋮ Unnamed Item ⋮ Coloring temporal graphs ⋮ On-line list coloring of matroids ⋮ Tight embeddings of partial quadrilateral packings ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ List edge and list total colorings of planar graphs without short cycles ⋮ Edge-choosability of planar graphs without non-induced 5-cycles ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof ⋮ Structural properties and edge choosability of planar graphs without 4-cycles ⋮ Edge-choosability of planar graphs without adjacent triangles or without 7-cycles ⋮ List edge colorings of planar graphs without adjacent 7-cycles ⋮ Handling fairness issues in time-relaxed tournaments with availability constraints ⋮ Proof of the list edge coloring conjecture for complete graphs of prime degree ⋮ Edge choosability of planar graphs without 5-cycles with a chord ⋮ Edge choosability of planar graphs without small cycles ⋮ Choosability, edge choosability and total choosability of outerplane graphs ⋮ Delay colouring in quartic graphs ⋮ On list edge-colorings of subcubic graphs ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ List edge coloring of planar graphs without non-induced 6-cycles ⋮ Some colouring problems for Paley graphs
This page was built for publication: New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
