Pages that link to "Item:Q1675533"
From MaRDI portal
The following pages link to Complexity classification of the edge coloring problem for a family of graph classes (Q1675533):
Displaying 10 items.
- The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices (Q892049) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Polynomial time complexity of edge colouring graphs with bounded colour classes (Q2249736) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Edge-coloring of split graphs. (Q2804810) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- A study of the boundary graph classes for colorability problems (Q5263795) (← links)
- Some cases of polynomial solvability for the edge colorability problem generated by forbidden 8-edge subcubic forests (Q5878618) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
