scientific article

Diego Scheide, Lene Monrad Favrholdt, Michael Stiebitz, Bjarne Toft

Publication date: 6 March 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Goldberg's conjecture Tashkinov trees Vizing fans

Trees (05C05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)

Related Items (71)

Integer round-up property for the chromatic number of some \(h\)-perfect graphs ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ INDUCED \(nK_{2}\) DECOMPOSITION OF INFINITE SQUARE GRIDS AND INFINITE HEXAGONAL GRIDS ⋮ On a limit of the method of Tashkinov trees for edge-colouring ⋮ One-sided interval edge-colorings of bipartite graphs ⋮ On a theorem of Goldberg ⋮ An improvement to the Hilton-Zhao vertex-splitting conjecture ⋮ Face-degree bounds for planar critical graphs ⋮ The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results ⋮ Zero-divisor graphs and total coloring conjecture ⋮ Hamiltonian cycles in critical graphs with large maximum degree ⋮ Extension from precoloured sets of edges ⋮ On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs ⋮ Reflexive coloring complexes for 3-edge-colorings of cubic graphs ⋮ Chromatic index of dense quasirandom graphs ⋮ A Combined Logarithmic Bound on the Chromatic Index of Multigraphs ⋮ A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture ⋮ A fast distributed algorithm for \((\Delta+1)\)-edge-coloring ⋮ Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) ⋮ A note on one-sided interval edge colorings of bipartite graphs ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Optimal Online Edge Coloring of Planar Graphs with Advice ⋮ On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees ⋮ Overfullness of critical class 2 graphs with a small core degree ⋮ Edge-colouring graphs with bounded local degree sums ⋮ A game generalizing Hall's theorem ⋮ Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable ⋮ Double Vizing fans in critical class two graphs ⋮ The average degree of edge chromatic critical graphs with maximum degree seven ⋮ Decomposition of class II graphs into two class I graphs ⋮ A note on Goldberg's conjecture on total chromatic numbers ⋮ Independence number of edge‐chromatic critical graphs ⋮ Edge coloring graphs with large minimum degree ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ Short Fans and the 5/6 Bound for Line Graphs ⋮ On Gupta’s Codensity Conjecture ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ The core conjecture of Hilton and Zhao ⋮ Tight bounds on the chromatic edge stability index of graphs ⋮ Overfullness of edge‐critical graphs with small minimal core degree ⋮ On the average degree of edge chromatic critical graphs. II. ⋮ Properties, proved and conjectured, of Keller, Mycielski, and queen graphs ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ Densities, Matchings, and Fractional Edge-Colorings ⋮ A new tool for proving Vizing's theorem ⋮ On the average degree of edge chromatic critical graphs ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Graph edge coloring: a survey ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Strong edge-colorings for \(k\)-degenerate graphs ⋮ Chromatic index, treewidth and maximum degree ⋮ Chromatic index determined by fractional chromatic index ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ Average degrees of edge-chromatic critical graphs ⋮ Measurable versions of Vizing's theorem ⋮ Vizing's coloring algorithm and the fan number ⋮ Locally self-avoiding Eulerian tours ⋮ The spectral radius of edge chromatic critical graphs ⋮ Upper bounds on the maximum degree of class two graphs on surfaces ⋮ Edge coloring multigraphs without small dense subsets ⋮ Some remarks on interval colorings of complete tripartite and biregular graphs ⋮ Achieving maximum chromatic index in multigraphs ⋮ Goldberg's conjecture is true for random multigraphs ⋮ The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 ⋮ On characterizing Vizing's edge colouring bound ⋮ On thef-matching polytope and the fractionalf-chromatic index ⋮ Structural properties of edge-chromatic critical multigraphs ⋮ On the coequal values of total chromatic number and chromatic index ⋮ A brief history of edge-colorings – with personal reminiscences ⋮ The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree

This page was built for publication: