The following pages link to (Q4262239):
Displaying 8 items.
- The chromatic index of multigraphs that are nearly full (Q910411) (← links)
- The chromatic index of nearly bipartite multigraphs (Q1076034) (← links)
- A vertex-splitting lemma, de Werra's theorem and improper list colourings (Q1366607) (← links)
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge (Q1690237) (← links)
- Computing the list chromatic index of graphs (Q1711669) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Edge-coloring almost bipartite multigraphs (Q2444912) (← links)
- (Q4735206) (← links)
