On the chromatic index of multigraphs without large triangles
From MaRDI portal
Publication:794661
DOI10.1016/0095-8956(84)90022-4zbMath0541.05027OpenAlexW2065218154MaRDI QIDQ794661
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(84)90022-4
Related Items (25)
The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) ⋮ On a limit of the method of Tashkinov trees for edge-colouring ⋮ Vizing bound for the chromatic number on some graph classes ⋮ Maximum Δ-edge-colorable subgraphs of class II graphs ⋮ Claw-free graphs---a survey ⋮ Applications of edge coloring of multigraphs to vertex coloring of graphs ⋮ On the chromatic number of a graph with two forbidden subgraphs ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Overfullness of critical class 2 graphs with a small core degree ⋮ A coloring algorithm for \(4 K_1\)-free line graphs ⋮ Double Vizing fans in critical class two graphs ⋮ Approximating the chromatic index of multigraphs ⋮ Tashkinov-trees: an annotated proof ⋮ 3-colorability and forbidden subgraphs. I: Characterizing pairs ⋮ Densities, Matchings, and Fractional Edge-Colorings ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Graph edge coloring: a survey ⋮ Chromatic index determined by fractional chromatic index ⋮ Average degrees of edge-chromatic critical graphs ⋮ Edge coloring multigraphs without small dense subsets ⋮ Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs ⋮ Achieving maximum chromatic index in multigraphs ⋮ Clique covers and coloring problems of graphs ⋮ On characterizing Vizing's edge colouring bound ⋮ A brief history of edge-colorings – with personal reminiscences
Cites Work
This page was built for publication: On the chromatic index of multigraphs without large triangles