The list chromatic index of simple graphs whose odd cycles intersect in at most one edge

DOI10.1016/j.disc.2017.11.012zbMath1378.05069arXiv1507.05933OpenAlexW2963341230MaRDI QIDQ1690237

Gregory J. Puleo, Jessica McDonald

Publication date: 19 January 2018

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

Full work available at URL: https://arxiv.org/abs/1507.05933

zbMATH Keywords

line graphodd cycleschromatic index2-connected graphedge list coloringkernel-perfect orientation

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Kernels in perfect line-graphs
• Edge-choosability in line-perfect multigraphs
• On kernel-perfect orientations of line graphs
• The list chromatic index of a bipartite multigraph
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles

This page was built for publication: The list chromatic index of simple graphs whose odd cycles intersect in at most one edge