Pages that link to "Item:Q1025461"
From MaRDI portal
The following pages link to Achieving maximum chromatic index in multigraphs (Q1025461):
Displaying 8 items.
- On a limit of the method of Tashkinov trees for edge-colouring (Q297916) (← links)
- On multiples of simple graphs and Vizing's theorem (Q982630) (← links)
- On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
- The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) (Q1926022) (← links)
- A refinement of Vizing's theorem (Q1978167) (← links)
- Edge coloring multigraphs without small dense subsets (Q2515595) (← links)
- On characterizing Vizing's edge colouring bound (Q3113286) (← links)
- On a theorem of Goldberg (Q3174233) (← links)