Pages that link to "Item:Q1739218"
From MaRDI portal
The following pages link to Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218):
Displaying 6 items.
- Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
- (Q5874489) (← links)
- (Q5878618) (← links)
