Pages that link to "Item:Q1196563"
From MaRDI portal
The following pages link to Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) (Q1196563):
Displaying 10 items.
- Recent results on the total chromatic number (Q686483) (← 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 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)
- (Q3984519) (← links)
- Total Chromatic Number of Graphs of Order 2<i>n</i> + l having Maximum Degree 2<i>n</i> − 1 (Q4894516) (← links)
- On total chromatic number of complete multipartite graphs (Q6547837) (← links)
- Total colorings of complete multipartite graphs using amalgamations (Q6633532) (← links)