The following pages link to (Q3070330):
Displaying 8 items.
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- The total-chromatic number of some families of snarks (Q536223) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
- Total chromatic number of {square,unichord}-free graphs (Q2883635) (← links)
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)