On edge-colorings of graphs.
From MaRDI portal
Publication:4149472
Cited in
(31)- Gap one bounds for the equitable chromatic number of block graphs
- A new method of proving theorems on chromatic index
- Chromatic index determined by fractional chromatic index
- Critical star multigraphs
- A combined logarithmic bound on the chromatic index of multigraphs
- Short fans and the 5/6 bound for line graphs
- Goldberg's conjecture is true for random multigraphs
- Applications of edge coloring of multigraphs to vertex coloring of graphs
- Improving a family of approximation algorithms to edge color multigraphs
- A generalization of edge-coloring in graphs
- On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
- A sufficient condition for equitable edge-colourings of simple graphs
- Lower bounds on the cover-index of a graph
- Vizing's coloring algorithm and the fan number
- A new tool for proving Vizing's theorem
- Embeddings of partial Steiner triple systems
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- A note concerning the chromatic index of multigraphs
- A brief history of edge-colorings -- with personal reminiscences
- The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)
- Some applications of Vizing's theorem to vertex colorings of graphs
- Approximating the chromatic index of multigraphs
- Structural properties of edge-chromatic critical multigraphs
- Improved bounds for the chromatic index of graphs and multigraphs
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- A theorem in edge colouring
- On Vizing's bound for the chromatic index of a multigraph
- A sublinear bound on the chromatic index of multigraphs
- Graph edge coloring: a survey
- An adjacency Lemma for critical multigraphs
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
This page was built for publication: On edge-colorings of graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4149472)