Pages that link to "Item:Q1044923"
From MaRDI portal
The following pages link to On Vizing's bound for the chromatic index of a multigraph (Q1044923):
Displaying 15 items.
- A comparison of two edge-coloring formulations (Q688209) (← links)
- Achieving maximum chromatic index in multigraphs (Q1025461) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Clique covers and coloring problems of graphs (Q1823258) (← links)
- The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) (Q1926022) (← links)
- A refinement of Vizing's theorem (Q1978167) (← links)
- Vizing's and Shannon's theorems for defective edge colouring (Q2094863) (← links)
- KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (Q2971036) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)
- On characterizing Vizing's edge colouring bound (Q3113286) (← links)
- A short proof for a generalization of Vizing's theorem (Q3351376) (← links)
- A generalization of edge-coloring in graphs (Q3735724) (← links)
- Improved bounds for the chromatic index of graphs and multigraphs (Q4719322) (← links)
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules (Q6041828) (← links)