List edge chromatic number of graphs with large girth

DOI10.1016/0012-365X(92)90602-CzbMath0766.05027MaRDI QIDQ1197027

Alexandr V. Kostochka

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90602-c

zbMATH Keywords

girth; maximum degree; edge chromatic number; proper coloring

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Edge-group choosability of outerplanar and near-outerplanar graphs, A note on edge-choosability of planar graphs without intersecting 4-cycles, Edge-choosability of planar graphs without non-induced 5-cycles, Structural properties and edge choosability of planar graphs without 4-cycles, Edge-choosability of planar graphs without adjacent triangles or without 7-cycles, Edge choosability of planar graphs without 5-cycles with a chord, Choosability and edge choosability of planar graphs without five cycles, List-edge-coloring of planar graphs without 6-cycles with three chords, Edge choosability of planar graphs without small cycles, List edge coloring of planar graphs without 6-cycles with two chords, A note on edge-group choosability of planar graphs without 5-cycles, List edge coloring of planar graphs without non-induced 6-cycles

Cites Work

• A new upper bound for the list chromatic number
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• An upper bound for the total chromatic number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item