Pages that link to "Item:Q968455"
From MaRDI portal
The following pages link to Graph edge colouring: Tashkinov trees and Goldberg's conjecture (Q968455):
Displaying 15 items.
- On a limit of the method of Tashkinov trees for edge-colouring (Q297916) (← links)
- On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Chromatic index determined by fractional chromatic index (Q1748268) (← links)
- Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
- Structural properties of edge-chromatic critical multigraphs (Q2338635) (← links)
- Edge coloring multigraphs without small dense subsets (Q2515595) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)
- On characterizing Vizing's edge colouring bound (Q3113286) (← links)
- On a theorem of Goldberg (Q3174233) (← links)
- A Combined Logarithmic Bound on the Chromatic Index of Multigraphs (Q5325936) (← links)
- Short Fans and the 5/6 Bound for Line Graphs (Q5357961) (← links)
- A brief history of edge-colorings – with personal reminiscences (Q5862696) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)