Pages that link to "Item:Q1739218"
From MaRDI portal
The following pages link to Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218):
Displaying 12 items.
- Häggkvist-Hell graphs: A class of Kneser-colorable graphs (Q764869) (← links)
- 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
- Choosability on \(H\)-free graphs (Q1943624) (← links)
- 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)
- Some cases of polynomial solvability for the edge colorability problem generated by forbidden 8-edge subcubic forests (Q5878618) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)