scientific article; zbMATH DE number 7790331
From MaRDI portal
Publication:6177586
zbMath1530.05043arXiv1909.01260MaRDI QIDQ6177586
Joshua Harrelson, Jessica McDonald
Publication date: 17 January 2024
Full work available at URL: https://arxiv.org/abs/1909.01260
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- Colorings and orientations of graphs
- List edge and list total colourings of multigraphs
- On kernel-perfect orientations of line graphs
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
- Computing the list chromatic index of graphs
- Planar graphs of maximum degree seven are Class I
- The list-chromatic index of \(K_6\)
- List edge colourings of some 1-factorable multigraphs
- The NP-Completeness of Edge-Coloring
- List Total Colourings of Graphs
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
- Every planar graph with maximum degree 7 is of class 1
This page was built for publication:
