The following pages link to Extending an edge-coloring (Q3484858):
Displaying 16 items.
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- List edge multicoloring in graphs with few cycles (Q1029053) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- The combinatorics of timetabling (Q1278524) (← links)
- List-edge-colouring planar graphs with precoloured edges (Q1621065) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Extension of colorings (Q1775039) (← links)
- Avoiding and extending partial edge colorings of hypercubes (Q2122768) (← links)
- Embedding connected factorizations (Q2131871) (← links)
- Restricted extension of sparse partial edge colorings of hypercubes (Q2198375) (← links)
- Edge list multicoloring trees: An extension of Hall's theorem (Q4800403) (← links)
- Precoloring Extension III: Classes of Perfect Graphs (Q4883061) (← links)
- (Q5026976) (← links)
- Toward a three-dimensional counterpart of Cruse's theorem (Q6490371) (← links)
- Extending partial edge colorings of iterated Cartesian products of cycles and paths (Q6606987) (← links)