The following pages link to (Q4022830):
Displaying 15 items.
- Impartial coloring games (Q388789) (← links)
- The total chromatic number of split-indifference graphs (Q442393) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- The total chromatic number of pseudo-Halin graphs with lower degree (Q1011742) (← links)
- The total chromatic number of regular graphs of high degree (Q1042999) (← links)
- The total chromatic number of graphs of even order and high degree (Q1408886) (← links)
- Generalization of two results of Hilton on total-colourings of a graph (Q1893175) (← links)
- Total colourings of graphs (Q1910691) (← links)
- Total chromatic number of regular graphs of odd order and high degree (Q1918537) (← links)
- The total chromatic number of regular graphs of even order and high degree (Q2570116) (← links)
- An extension of Vizing's theorem (Q3129828) (← links)
- Total Colourings of Graphs (Q3775574) (← links)
- (Q3841345) (← links)
- Total Colouring of New Classes of Subcubic graphs (Q5044527) (← links)