Pages that link to "Item:Q2249736"
From MaRDI portal
The following pages link to Polynomial time complexity of edge colouring graphs with bounded colour classes (Q2249736):
Displaying 6 items.
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic (Q666002) (← links)
- Excessive \([l, m]\)-factorizations (Q2352055) (← links)
- On the complexity of computing the excessive \([B]\)-index of a graph (Q2811195) (← links)
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile (Q4680754) (← links)
- A study of the boundary graph classes for colorability problems (Q5263795) (← links)
- (Q5866345) (← links)