Pages that link to "Item:Q1675533"

The following pages link to Complexity classification of the edge coloring problem for a family of graph classes (Q1675533):

Displaying 3 items.

• Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
• Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
• (Q5878618) (← links)