Publication:3118960
From MaRDI portal
zbMath1339.05001MaRDI QIDQ3118960
Diego Scheide, Lene Monrad Favrholdt, Michael Stiebitz, Bjarne Toft
Publication date: 6 March 2012
05C05: Trees
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C15: Coloring of graphs and hypergraphs
Related Items
Properties, proved and conjectured, of Keller, Mycielski, and queen graphs, Densities, Matchings, and Fractional Edge-Colorings, INDUCED \(nK_{2}\) DECOMPOSITION OF INFINITE SQUARE GRIDS AND INFINITE HEXAGONAL GRIDS, The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4, On thef-matching polytope and the fractionalf-chromatic index, Proof of the 1-factorization and Hamilton Decomposition Conjectures, 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, Short Fans and the 5/6 Bound for Line Graphs, Optimal path and cycle decompositions of dense quasirandom graphs, Chromatic index, treewidth and maximum degree, Locally self-avoiding Eulerian tours, The spectral radius of edge chromatic critical graphs, A brief history of edge-colorings – with personal reminiscences, The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree, 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, On Gupta’s Codensity Conjecture, On a limit of the method of Tashkinov trees for edge-colouring, Face-degree bounds for planar critical graphs, The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems, Hamiltonian cycles in critical graphs with large maximum degree, A game generalizing Hall's theorem, Strong edge-colorings for \(k\)-degenerate graphs, Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture, Measures of edge-uncolorability of cubic graphs, Achieving maximum chromatic index in multigraphs, Extension from precoloured sets of edges, On maximum \(k\)-edge-colorable subgraphs of bipartite graphs, Graph edge coloring: a survey, Chromatic index determined by fractional chromatic index, Average degrees of edge-chromatic critical graphs, Measurable versions of Vizing's theorem, On the coequal values of total chromatic number and chromatic index, An improvement to the Hilton-Zhao vertex-splitting conjecture, Zero-divisor graphs and total coloring conjecture, Chromatic index of dense quasirandom graphs, Hamiltonicity of edge-chromatic critical graphs, Edge-colouring graphs with bounded local degree sums, On the average degree of edge chromatic critical graphs. II., On the average degree of edge chromatic critical graphs, Upper bounds on the maximum degree of class two graphs on surfaces, Some remarks on interval colorings of complete tripartite and biregular graphs, Goldberg's conjecture is true for random multigraphs, Structural properties of edge-chromatic critical multigraphs, Integer round-up property for the chromatic number of some \(h\)-perfect graphs, On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs, Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\), A new tool for proving Vizing's theorem, Edge coloring multigraphs without small dense subsets, One-sided interval edge-colorings of bipartite graphs, Reflexive coloring complexes for 3-edge-colorings of cubic graphs, A fast distributed algorithm for \((\Delta+1)\)-edge-coloring, A note on one-sided interval edge colorings of bipartite graphs, Overfullness of critical class 2 graphs with a small core degree, Optimal Online Edge Coloring of Planar Graphs with Advice, On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees, Vizing's coloring algorithm and the fan number, On characterizing Vizing's edge colouring bound, On a theorem of Goldberg, Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results
