Pages that link to "Item:Q1173977"
From MaRDI portal
The following pages link to NP-completeness of edge-colouring some restricted graphs (Q1173977):
Displaying 11 items.
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
