Graph edge coloring: a survey
type: Item
instance of: scholarly article
title: Graph edge coloring: a survey
zbMATH Open document ID: 1407.05087
author: Yan Cao
author: Guantao Chen
author: Guangming Jing
author: Michael Stiebitz
author: Bjarne Toft
published in: Graphs and Combinatorics
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7040456
zbMATH Keywords: chromatic index
zbMATH Keywords: edge coloring
zbMATH Keywords: adjacency lemma
MaRDI profile type: Publication
full work available at URL: s00373-018-1986-5
OpenAlex ID: W2907565004
cites work: The chromatic index of a graph whose core has maximum degree 2
cites work: The chromatic index of a graph whose core is a cycle of order at most 13
cites work: The chromatic index of a claw-free graph whose core has maximum degree 2
cites work: On edge-colorings of graphs.
cites work: On a limit of the method of Tashkinov trees for edge-colouring
cites work: Q5354846
cites work: Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
cites work: Q4595649
cites work: Chromatic index, treewidth and maximum degree
cites work: NP-completeness of edge-colouring some restricted graphs
cites work: Average degrees of edge-chromatic critical graphs
cites work: Hamiltonicity of edge-chromatic critical graphs
cites work: Colouring the petals of a graph
cites work: Chromatic index determined by fractional chromatic index
cites work: Vizing's 2‐Factor Conjecture Involving Large Maximum Degree
cites work: Approximating the chromatic index of multigraphs
cites work: Densities, Matchings, and Fractional Edge-Colorings
cites work: A note on the size of edge-chromatic 4-critical graphs
cites work: Regular Graphs of High Degree are 1-Factorizable
cites work: 1-factorizing regular graphs of high degree - an improved bound
cites work: Edge-colouring seven-regular planar graphs
cites work: Edge-colouring eight-regular planar graphs
cites work: Subcubic Edge‐Chromatic Critical Graphs Have Many Edges
cites work: Short Fans and the 5/6 Bound for Line Graphs
cites work: The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4
cites work: Proof of the 1-factorization and Hamilton Decomposition Conjectures
cites work: Packing six \(T\)-joins in plane graphs
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Extension from precoloured sets of edges
cites work: Three-edge-colouring doublecross cubic graphs
cites work: On the chromatic index of almost all graphs
cites work: Q3118960
cites work: Q4487452
cites work: Q3853641
cites work: Q5181716
cites work: Q4056033
cites work: Q3048873
cites work: Edge-coloring of multigraphs: Recoloring technique
cites work: Chromatic-index critical multigraphs of order 20
cites work: On the chromatic index and the cover index of a multigraph
cites work: List-edge-colouring planar graphs with precoloured edges
cites work: Edge coloring multigraphs without small dense subsets
cites work: Goldberg's conjecture is true for random multigraphs
cites work: On characterizing Vizing's edge colouring bound
cites work: Q4892326
cites work: A better than “best possible” algorithm to edge color multigraphs
cites work: The NP-Completeness of Edge-Coloring
cites work: Planar graphs of maximum degree six without 7-cycles are class one
cites work: On critical graphs with chromatic index 4
cites work: Q4099665
cites work: Q3134305
cites work: Remarks on planar edge-chromatic critical graphs
cites work: Asymptotics of the chromatic index for multigraphs
cites work: Vizing's 2-factor conjecture involving toughness and maximum degree conditions
cites work: On the chromatic index of multigraphs without large triangles
cites work: A new tool for proving Vizing's theorem
cites work: Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
cites work: Hamiltonian cycles in critical graphs with large maximum degree
cites work: A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture
cites work: Decompositions for edge-coloring join graphs and cobipartite graphs
cites work: Edge-colouring and total-colouring chordless graphs

Graph edge coloring: a survey (cites work)
cites work: Optimal edge-colourings for a class of planar multigraphs

Graph edge coloring: a survey (cites work)
cites work: Extending an edge-coloring

Graph edge coloring: a survey (cites work)
cites work: On a theorem of Goldberg

Graph edge coloring: a survey (cites work)
cites work: On the size of edge-coloring critical graphs with maximum degree 4

Graph edge coloring: a survey (cites work)
cites work: On the average degree of critical graphs with maximum degree six

Graph edge coloring: a survey (cites work)
cites work: Edge-coloring of split graphs.

Graph edge coloring: a survey (cites work)
cites work: Edge coloring of planar graphs which any two short cycles are adjacent at most once

Graph edge coloring: a survey (cites work)
cites work: On the $1.1$ Edge-Coloring of Multigraphs

Graph edge coloring: a survey (cites work)
cites work: On the independence number of edge chromatic critical graphs

Graph edge coloring: a survey (cites work)
cites work: Edge coloring regular graphs of high degree

Graph edge coloring: a survey (cites work)
cites work: A Combined Logarithmic Bound on the Chromatic Index of Multigraphs

Graph edge coloring: a survey (cites work)
cites work: All regular multigraphs of even order and high degree are 1-factorable

Graph edge coloring: a survey (cites work)
cites work: Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture

Graph edge coloring: a survey (cites work)
cites work: Ein Sechsfarbenproblem auf der Kugel

Graph edge coloring: a survey (cites work)
cites work: The four-colour theorem

Graph edge coloring: a survey (cites work)
cites work: Tutte's edge-colouring conjecture

Graph edge coloring: a survey (cites work)
cites work: Excluded minors in cubic graphs

Graph edge coloring: a survey (cites work)
cites work: An asymptotic approximation scheme for multigraph edge coloring

Graph edge coloring: a survey (cites work)
cites work: Planar graphs of maximum degree seven are Class I

Graph edge coloring: a survey (cites work)
cites work: Graph edge colouring: Tashkinov trees and Goldberg's conjecture

Graph edge coloring: a survey (cites work)
cites work: On Vizing's bound for the chromatic index of a multigraph

Graph edge coloring: a survey (cites work)
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)

Graph edge coloring: a survey (cites work)
cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte

Graph edge coloring: a survey (cites work)
cites work: On Tutte's extension of the four-colour problem

Graph edge coloring: a survey (cites work)
cites work: Colouring series-parallel graphs

Graph edge coloring: a survey (cites work)
cites work: A Theorem on Coloring the Lines of a Network

Graph edge coloring: a survey (cites work)
cites work: Edge-colouring of joins of regular graphs. II

Graph edge coloring: a survey (cites work)
cites work: Approximating Vizing's independence number conjecture

Graph edge coloring: a survey (cites work)
cites work: Q4527280

Graph edge coloring: a survey (cites work)
cites work: On the algebraic theory of graph colorings

Graph edge coloring: a survey (cites work)
cites work: A conjecture on triangles of graphs

Graph edge coloring: a survey (cites work)
cites work: An Asymptotic Version of the Multigraph 1‐Factorization Conjecture

Graph edge coloring: a survey (cites work)
cites work: Q5558480

Graph edge coloring: a survey (cites work)
cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY

Graph edge coloring: a survey (cites work)
cites work: Edge coloring of graphs embedded in a surface of nonnegative characteristic

Graph edge coloring: a survey (cites work)
cites work: A sufficient condition for a plane graph with maximum degree 6 to be class 1

Graph edge coloring: a survey (cites work)
cites work: The average degree of an edge‐chromatic critical graph II

Graph edge coloring: a survey (cites work)
cites work: The independence number of an edge-chromatic critical graph

Graph edge coloring: a survey (cites work)
cites work: Edge colorings of planar graphs without 5-cycles with two chords

Graph edge coloring: a survey (cites work)
cites work: Every planar graph with maximum degree 7 is of class 1

Graph edge coloring: a survey (cites work)
cites work: Some sufficient conditions for 1-planar graphs to be class 1

Graph edge coloring: a survey (cites work)
cites work: Edge coloring of planar graphs without adjacent 7-cycles

Graph edge coloring: a survey (cites work)
cites work: The edge chromatic number of outer-1-planar graphs

Graph edge coloring: a survey (cites work)
cites work: On edge colorings of 1-planar graphs without adjacent triangles

Graph edge coloring: a survey (cites work)
cites work: Q4909715

Graph edge coloring: a survey (cites work)
cites work: On edge colorings of \(1\)-planar graphs

Graph edge coloring: a survey (cites work)
cites work: On the chromatic index of join graphs and triangle-free graphs with large maximum degree

Graph edge coloring: a survey (Wikidata QID)
Wikidata QID: Q128638222

Graph edge coloring: a survey (DOI)
DOI: 10.1007/S00373-018-1986-5