Pages that link to "Item:Q801928"
From MaRDI portal
The following pages link to A new method of proving theorems on chromatic index (Q801928):
Displaying 9 items.
- A game generalizing Hall's theorem (Q394371) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- A polyhedral approach to edge coloring (Q1180838) (← links)
- On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs (Q1363709) (← links)
- Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation (Q1774528) (← links)
- An application of matching theory of edge-colourings (Q1923520) (← links)
- A new tool for proving Vizing's theorem (Q2449145) (← links)
- The core conjecture of Hilton and Zhao (Q6196157) (← links)
- Kempe classes and almost bipartite graphs (Q6611011) (← links)
