scientific article
From MaRDI portal
Publication:4056033
zbMath0301.05110MaRDI QIDQ4056033
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
On the chromatic index of multigraphs and a conjecture of Seymour (I) ⋮ On a limit of the method of Tashkinov trees for edge-colouring ⋮ The chromatic index of multigraphs of order at most 10 ⋮ Co-density and fractional edge cover packing ⋮ Fair representation in the intersection of two matroids ⋮ A note on Goldberg's conjecture on total chromatic numbers ⋮ Asymptotics of the chromatic number for quasi-line graphs ⋮ Fair representation in dimatroids ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ Short Fans and the 5/6 Bound for Line Graphs ⋮ On Gupta’s Codensity Conjecture ⋮ Densities, Matchings, and Fractional Edge-Colorings ⋮ The edge covering number of the intersection of two matroids ⋮ Graph edge coloring: a survey ⋮ A superlocal version of Reed's conjecture ⋮ An upper bound for the chromatic number of line graphs ⋮ Graph edge colouring: Tashkinov trees and Goldberg's conjecture ⋮ On multiples of simple graphs and Vizing's theorem ⋮ Edge coloring multigraphs without small dense subsets ⋮ Achieving maximum chromatic index in 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 ⋮ Vizing's and Shannon's theorems for defective edge colouring ⋮ Edge coloring nearly bipartite graphs ⋮ A brief history of edge-colorings – with personal reminiscences
This page was built for publication:
