Graph edge coloring: a survey
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3643303 (Why is no real title available?)
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3470445 (Why is no real title available?)
- scientific article; zbMATH DE number 3522008 (Why is no real title available?)
- scientific article; zbMATH DE number 1463393 (Why is no real title available?)
- scientific article; zbMATH DE number 1560509 (Why is no real title available?)
- scientific article; zbMATH DE number 927053 (Why is no real title available?)
- scientific article; zbMATH DE number 3428958 (Why is no real title available?)
- scientific article; zbMATH DE number 6769478 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- 1-factorizing regular graphs of high degree - an improved bound
- A Theorem on Coloring the Lines of a Network
- A better than “best possible” algorithm to edge color multigraphs
- A combined logarithmic bound on the chromatic index of multigraphs
- A conjecture on triangles of graphs
- A new tool for proving Vizing's theorem
- A note on the size of edge-chromatic 4-critical graphs
- A sufficient condition for a plane graph with maximum degree 6 to be class 1
- A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture
- All regular multigraphs of even order and high degree are 1-factorable
- An asymptotic approximation scheme for multigraph edge coloring
- An asymptotic version of the multigraph 1-factorization conjecture
- Approximating Vizing's independence number conjecture
- Approximating the chromatic index of multigraphs
- Asymptotics of the chromatic index for multigraphs
- Average degrees of edge-chromatic critical graphs
- Chromatic index determined by fractional chromatic index
- Chromatic index, treewidth and maximum degree
- Chromatic-index critical multigraphs of order 20
- Colouring series-parallel graphs
- Colouring the petals of a graph
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
- Decompositions for edge-coloring join graphs and cobipartite graphs
- Densities, matchings, and fractional edge-colorings
- Edge coloring multigraphs without small dense subsets
- Edge coloring of \(1\)-planar graphs without intersecting triangles and chordal \(5\)-cycles.
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- Edge coloring of planar graphs which any two short cycles are adjacent at most once
- Edge coloring of planar graphs without adjacent 7-cycles
- Edge coloring regular graphs of high degree
- Edge colorings of planar graphs without 5-cycles with two chords
- Edge-Kempe-equivalence graphs of class-1 regular graphs
- Edge-coloring of multigraphs: Recoloring technique
- Edge-coloring of split graphs.
- Edge-colouring and total-colouring chordless graphs
- Edge-colouring eight-regular planar graphs
- Edge-colouring of joins of regular graphs. II
- Edge-colouring seven-regular planar graphs
- Ein Sechsfarbenproblem auf der Kugel
- Every planar graph with maximum degree 7 is of class 1
- Excluded minors in cubic graphs
- Extending an edge-coloring
- Extension from precoloured sets of edges
- Goldberg's conjecture is true for random multigraphs
- Graph edge coloring. Vizing's theorem and Goldberg's conjecture
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- Hamiltonian cycles in critical graphs with large maximum degree
- List-edge-colouring planar graphs with precoloured edges
- Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
- Maximum matching and a polyhedron with 0,1-vertices
- NP-completeness of edge-colouring some restricted graphs
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- On Tutte's extension of the four-colour problem
- On Vizing's bound for the chromatic index of a multigraph
- On a limit of the method of Tashkinov trees for edge-colouring
- On a theorem of Goldberg
- On characterizing Vizing's edge colouring bound
- On critical graphs with chromatic index 4
- On edge colorings of 1-planar graphs without adjacent triangles
- On edge colorings of 1-planar graphs without chordal 5-cycles.
- On edge colorings of \(1\)-planar graphs
- On edge-colorings of graphs.
- On the $1.1$ Edge-Coloring of Multigraphs
- On the algebraic theory of graph colorings
- On the average degree of critical graphs with maximum degree six
- On the chromatic index and the cover index of a multigraph
- On the chromatic index of almost all graphs
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- On the chromatic index of multigraphs without large triangles
- On the independence number of edge chromatic critical graphs
- On the size of edge-coloring critical graphs with maximum degree 4
- Optimal edge-colourings for a class of planar multigraphs
- Packing six \(T\)-joins in plane graphs
- Planar graphs of maximum degree seven are Class I
- Planar graphs of maximum degree six without 7-cycles are class one
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- Regular Graphs of High Degree are 1-Factorizable
- Remarks on planar edge-chromatic critical graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Short fans and the 5/6 bound for line graphs
- Some sufficient conditions for 1-planar graphs to be class 1
- Subcubic edge-chromatic critical graphs have many edges
- The Hilton-Zhao conjecture is true for graphs with maximum degree 4
- The NP-Completeness of Edge-Coloring
- The average degree of an edge‐chromatic critical graph II
- The chromatic index of a claw-free graph whose core has maximum degree 2
- The chromatic index of a graph whose core has maximum degree 2
- The chromatic index of a graph whose core is a cycle of order at most 13
- The edge chromatic number of outer-1-planar graphs
- The four-colour theorem
- The independence number of an edge-chromatic critical graph
- Three-edge-colouring doublecross cubic graphs
- Tutte's edge-colouring conjecture
- Vizing's 2-factor conjecture involving large maximum degree
- Vizing's 2-factor conjecture involving toughness and maximum degree conditions
Cited in
(33)- On the chromatic edge stability index of graphs
- Decomposing the edges of a graph into simpler structures
- scientific article; zbMATH DE number 1302184 (Why is no real title available?)
- On resolving edge colorings in graphs
- The average degree of edge chromatic critical graphs with maximum degree seven
- Properties of large 2-crossing-critical graphs
- Parameterized complexity of \textsc{maximum edge colorable subgraph}
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- On a limit of the method of Tashkinov trees for edge-colouring
- On edge orienting methods for graph coloring
- Double Vizing fans in critical class two graphs
- Some Topics on Edge-Coloring
- Subcubic planar graphs of girth 7 are class I
- Complexity and approximation results on the shared transportation problem
- On the shared transportation problem: computational hardness and exact approach
- Kempe classes and almost bipartite graphs
- A brief history of edge-colorings -- with personal reminiscences
- On the average degree of edge chromatic critical graphs
- Fractional matchings, component-factors and edge-chromatic critical graphs
- Switching 3-edge-colorings of cubic graphs
- The method of coloring in graphs and its application
- Hamiltonian cycles and 1-factors in 5-regular graphs
- Conflict-free incidence coloring of outer-1-planar graphs
- Graph edge coloring. Vizing's theorem and Goldberg's conjecture
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
- Recent results of Novosibirsk mathematicians in graph theory
- scientific article; zbMATH DE number 3966101 (Why is no real title available?)
- Parameterized complexity of maximum edge colorable subgraph
- A survey of graph coloring -- its types, methods and applications
- scientific article; zbMATH DE number 68344 (Why is no real title available?)
- On the average degree of edge chromatic critical graphs. II.
- On the maximum number of edges in chordal graphs of bounded degree and matching number
This page was built for publication: Graph edge coloring: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733850)
