scientific article; zbMATH DE number 3470445

Cited in

(33)

Achieving maximum chromatic index in multigraphs
A theorem in edge colouring
On Vizing's bound for the chromatic index of a multigraph
On the chromatic index of multigraphs and a conjecture of Seymour (I)
A sublinear bound on the chromatic index of multigraphs
Edge coloring nearly bipartite graphs
The chromatic index of multigraphs of order at most 10
Fair representation in dimatroids
Graph edge coloring: a survey
Vizing's and Shannon's theorems for defective edge colouring
Co-density and fractional edge cover packing
Fair representation in the intersection of two matroids
An upper bound for the chromatic number of line graphs
Edge coloring multigraphs without small dense subsets
On a limit of the method of Tashkinov trees for edge-colouring
Densities, matchings, and fractional edge-colorings
A superlocal version of Reed's conjecture
Short fans and the 5/6 bound for line graphs
A brief history of edge-colorings -- with personal reminiscences
A note on Goldberg's conjecture on total chromatic numbers
Graph and hypergraph colouring via nibble methods: a survey
Orientation‐based edge‐colorings and linear arboricity of multigraphs
On Gupta’s Codensity Conjecture
Gap one bounds for the equitable chromatic number of block graphs
The edge covering number of the intersection of two matroids
Precoloring extension of Vizing's theorem for multigraphs
Block graphs -- some general results and their equitable colorings
A characterization of multigraphs reaching Goldberg's bound of chromatic index
Proof of the Goldberg-Seymour conjecture on edge-colorings of multigraphs
Graph theory. Abstracts from the workshop held January 5--10, 2025
A nonplanar critical multigraph that achieves Goldberg's bound
Graph edge colouring: Tashkinov trees and Goldberg's conjecture
On multiples of simple graphs and Vizing's theorem

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 Q4056033)