Pages that link to "Item:Q1179463"

The following pages link to The total chromatic number of nearly complete bipartite graphs (Q1179463):

Displaying 7 items.

• Recent results on the total chromatic number (Q686483) (← links)
• Total colouring regular bipartite graphs is NP-hard (Q1313834) (← links)
• A study of the total chromatic number of equibipartite graphs (Q1584229) (← links)
• Generalization of two results of Hilton on total-colourings of a graph (Q1893175) (← links)
• The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
• On the total and AVD-total coloring of graphs (Q4956171) (← links)
• On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs (Q5054777) (← links)