The following pages link to (Q4322680):
Displaying 3 items.
- Equitable total coloring of graphs with maximum degree 3 (Q1865129) (← links)
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102) (← links)
- Graphs of maximum degree 3 and order at most 16 which are critical with respect to the total chromatic number (Q3987048) (← links)