Pages that link to "Item:Q2494102"
From MaRDI portal
The following pages link to The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102):
Displaying 6 items.
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Equitable total coloring of \(C_m\square C_n\) (Q1028450) (← 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)
