List-edge-colouring planar graphs with precoloured edges

DOI10.1016/j.ejc.2018.07.003zbMath1400.05084arXiv1709.04027OpenAlexW2964225029MaRDI QIDQ1621065

Gregory J. Puleo, Joshua Harrelson, Jessica McDonald

Publication date: 15 November 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic index

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (3)

Embedding connected factorizations ⋮ Maximum average degree of list-edge-critical graphs and Vizing's conjecture ⋮ Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
• The complexity of completing partial Latin squares
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• List edge and list total colourings of multigraphs
• Extension from precoloured sets of edges
• Planar graphs of maximum degree seven are Class I
• Extending an edge-coloring
• The NP-Completeness of Edge-Coloring
• NP‐completeness of list coloring and precoloring extension on the edges of planar graphs
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: List-edge-colouring planar graphs with precoloured edges