Pages that link to "Item:Q750449"

The following pages link to A total-chromatic number analogue of Plantholt's theorem (Q750449):

Displaying 14 items.

• The total chromatic number of split-indifference graphs (Q442393) (← links)
• Recent results on the total chromatic number (Q686483) (← links)
• The total chromatic number of nearly complete bipartite graphs (Q1179463) (← links)
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) (Q1196563) (← links)
• Total chromatic number of graphs of odd order and high degree (Q1301827) (← links)
• Totally critical even order graphs (Q1306315) (← links)
• The total chromatic number of regular graphs whose complement is bipartite (Q1318798) (← 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)
• On total coloring of some classes of regular graphs (Q2167796) (← links)
• Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
• Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
• Total chromatic number of one kind of join graphs (Q2501562) (← links)
• On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs (Q5054777) (← links)