scientific article; zbMATH DE number 1560509
From MaRDI portal
Publication:4527280
Recommendations
Cited in
(30)- Achieving maximum chromatic index in multigraphs
- On Vizing's bound for the chromatic index of a multigraph
- On resolving edge colorings in graphs
- Graph edge coloring: a survey
- Chromatic index determined by fractional chromatic index
- An application of matching theory of edge-colourings
- Average degrees of edge-chromatic critical graphs
- Goldberg's conjecture is true for random multigraphs
- Structural properties of edge-chromatic critical multigraphs
- On edge orienting methods for graph coloring
- Edge coloring multigraphs without small dense subsets
- Edge-colorings of some large graphs on alphabets
- On a limit of the method of Tashkinov trees for edge-colouring
- Vizing's coloring algorithm and the fan number
- On characterizing Vizing's edge colouring bound
- On a theorem of Goldberg
- On the $1.1$ Edge-Coloring of Multigraphs
- scientific article; zbMATH DE number 3914343 (Why is no real title available?)
- Densities, matchings, and fractional edge-colorings
- An asymptotic approximation scheme for multigraph edge coloring
- A combined logarithmic bound on the chromatic index of multigraphs
- A brief history of edge-colorings -- with personal reminiscences
- Double Vizing fans in critical class two graphs
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- Tashkinov-trees: an annotated proof
- Approximating the chromatic index of multigraphs
- Kempe classes and almost bipartite graphs
- Proof of the Goldberg-Seymour conjecture on edge-colorings of multigraphs
- Graph theory. Abstracts from the workshop held January 5--10, 2025
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527280)
