Pages that link to "Item:Q2515595"
From MaRDI portal
The following pages link to Edge coloring multigraphs without small dense subsets (Q2515595):
Displaying 12 items.
- Clusters in a multigraph with elevated density (Q870066) (← links)
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture (Q968455) (← links)
- On the chromatic index of multigraphs and a conjecture of Seymour (I) (Q1084107) (← links)
- Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
- Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) (Q1584243) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
- Structural properties of edge-chromatic critical multigraphs (Q2338635) (← links)
- On characterizing Vizing's edge colouring bound (Q3113286) (← links)
- On a theorem of Goldberg (Q3174233) (← links)
- On the inclusion chromatic index of a graph (Q6055925) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)