On edge-colorings of graphs.
From MaRDI portal
Publication:4149472
DOI10.7146/math.scand.a-11685zbMath0373.05035OpenAlexW2530720229MaRDI QIDQ4149472
Publication date: 1977
Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/166524
Related Items (30)
The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) ⋮ Improving a family of approximation algorithms to edge color multigraphs ⋮ Critical star multigraphs ⋮ On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs ⋮ A generalization of edge-coloring in graphs ⋮ A Combined Logarithmic Bound on the Chromatic Index of Multigraphs ⋮ Applications of edge coloring of multigraphs to vertex coloring of graphs ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ Short Fans and the 5/6 Bound for Line Graphs ⋮ Approximating the chromatic index of multigraphs ⋮ Improved bounds for the chromatic index of graphs and multigraphs ⋮ A note concerning the chromatic index of multigraphs ⋮ A new tool for proving Vizing's theorem ⋮ Graph edge coloring: a survey ⋮ An adjacency Lemma for critical multigraphs ⋮ Chromatic index determined by fractional chromatic index ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ Graph edge colouring: Tashkinov trees and Goldberg's conjecture ⋮ Vizing's coloring algorithm and the fan number ⋮ Lower bounds on the cover-index of a graph ⋮ Goldberg's conjecture is true for random multigraphs ⋮ Embeddings of partial Steiner triple systems ⋮ A theorem in edge colouring ⋮ On Vizing's bound for the chromatic index of a multigraph ⋮ Some applications of Vizing's theorem to vertex colorings of graphs ⋮ A sublinear bound on the chromatic index of multigraphs ⋮ Structural properties of edge-chromatic critical multigraphs ⋮ A brief history of edge-colorings – with personal reminiscences ⋮ A new method of proving theorems on chromatic index ⋮ A sufficient condition for equitable edge-colourings of simple graphs
This page was built for publication: On edge-colorings of graphs.
