Extension from precoloured sets of edges
From MaRDI portal
Publication:1658745
zbMath1393.05115arXiv1407.4339MaRDI QIDQ1658745
Gregory J. Puleo, António Girão, Jean-Sébastien Sereni, Ross J. Kang, Katherine Edwards, Jan van den Heuvel
Publication date: 15 August 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.4339
File on IPFS
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (11)
Avoiding and extending partial edge colorings of hypercubes ⋮ List-edge-colouring planar graphs with precoloured edges ⋮ Embedding connected factorizations ⋮ Brooks' theorem with forbidden colors ⋮ Restricted extension of sparse partial edge colorings of hypercubes ⋮ Unnamed Item ⋮ Graph edge coloring: a survey ⋮ Latin cubes with forbidden entries ⋮ Extending partial edge colorings of iterated Cartesian products of cycles and paths ⋮ Precoloring extension of Vizing's theorem for multigraphs ⋮ Latin cubes of even order with forbidden entries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
- On Vizing's bound for the chromatic index of a multigraph
- Asymptotics of the chromatic index for multigraphs
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- You can't paint yourself into a corner
- Every planar graph is 5-choosable
- List edge and list total colourings of multigraphs
- Color-critical graphs on a fixed surface
- On list edge-colorings of subcubic graphs
- Planar graphs of maximum degree seven are Class I
- A note on graph coloring extensions and list-colorings
- The list chromatic index of a bipartite multigraph
- Asymptotically good list-colorings
- An application of matching theory of edge-colourings
- A note on \(K^-_{\Delta +1}\)-free precolouring with \(\Delta\) colours
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
- KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
- A short proof for a generalization of Vizing's theorem
- Extending an edge-coloring
- On decompositions of a multi-graph into spanning subgraphs
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Near-optimal list colorings
- Graphs of degree 4 are 5-edge-choosable
- Precoloring Extensions of Brooks' Theorem
- A Theorem on Coloring the Lines of a Network
- Extending graph colorings using no extra colors
- Graph colouring and the probabilistic method
This page was built for publication: Extension from precoloured sets of edges
