Total colorings of graphs of order 2n having maximum degree 2n-2
From MaRDI portal
(Redirected from Publication:1196563)
Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
Recommendations
- Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1
- The total chromatic number of graphs having large maximum degree
- scientific article; zbMATH DE number 798659
- Total chromatic number of graphs of odd order and high degree
- The total chromatic number of graphs of even order and high degree
Cites work
- A total-chromatic number analogue of Plantholt's theorem
- Graph theory with applications
- scientific article; zbMATH DE number 4108788 (Why is no real title available?)
- On the total coloring of certain graphs
- The Colour Numbers of Complete Graphs
- The total coloring of a multigraph with maximal degree 4
- Total Colourings of Graphs
Cited in
(12)- Total chromatic number of graphs of odd order and high degree
- Totally critical even order graphs
- The total chromatic number of graphs of even order and high degree
- Generalization of two results of Hilton on total-colourings of a graph
- On total coloring of some classes of regular graphs
- scientific article; zbMATH DE number 26318 (Why is no real title available?)
- scientific article; zbMATH DE number 2059716 (Why is no real title available?)
- Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1
- On total chromatic number of complete multipartite graphs
- Total colorings of complete multipartite graphs using amalgamations
- Recent results on the total chromatic number
- On total chromatic number of complete multipartite graphs
This page was built for publication: Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196563)
