The total chromatic number of graphs having large maximum degree
From MaRDI portal
(Redirected from Publication:686156)
Recommendations
- The Total Chromatic Number of Graphs of High Minimum Degree
- Total chromatic number of graphs of odd order and high degree
- Recent results on the total chromatic number
- An upper bound for total colouring of graphs
- scientific article; zbMATH DE number 30752
- An upper bound for the total chromatic number of dense graphs
- The total chromatic number of regular graphs of even order and high degree
- scientific article; zbMATH DE number 98760
- scientific article; zbMATH DE number 4150186
- scientific article; zbMATH DE number 4108788
Cites work
- scientific article; zbMATH DE number 4150186 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3659620 (Why is no real title available?)
- scientific article; zbMATH DE number 3637904 (Why is no real title available?)
- scientific article; zbMATH DE number 867691 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- An upper bound for the total chromatic number
- An upper bound for the total chromatic number of dense graphs
- Complementary Graphs and Edge Chromatic Numbers
- Determining the total colouring number is NP-hard
- Hamiltonism, degree sum and neighborhood intersections
- On Total Chromatic Number of a Graph
- On the total coloring of certain graphs
- Packing of graphs - a survey
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The Colour Numbers of Complete Graphs
- The Total Chromatic Number of Graphs of High Minimum Degree
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
- The total coloring of a multigraph with maximal degree 4
Cited in
(46)- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Total chromatic number of generalized Mycielski graphs
- Recent results on the total chromatic number
- scientific article; zbMATH DE number 798659 (Why is no real title available?)
- Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1
- scientific article; zbMATH DE number 4108788 (Why is no real title available?)
- Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
- Total chromatic number for certain classes of product graphs
- Total chromatic number of graphs of odd order and high degree
- Total colorings-a survey
- The total chromatic number of regular graphs whose complement is bipartite
- Fractional total colourings of graphs of high girth
- Generalization of two results of Hilton on total-colourings of a graph
- On graphs having prescribed clique number, chromatic number, and maximum degree
- scientific article; zbMATH DE number 1852751 (Why is no real title available?)
- The total chromatic number of graphs of even order and high degree
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
- Totally critical even order graphs
- Total coloring of the prismatic graphs
- The total chromatic number of regular graphs of even order and high degree
- scientific article; zbMATH DE number 4150186 (Why is no real title available?)
- Total coloring of certain classes of product graphs
- On the set of circular total chromatic numbers of graphs
- Total chromatic number of regular graphs of odd order and high degree
- Total coloring of quasi-line graphs and inflated graphs
- Total coloring conjecture on certain classes of product graphs
- Recent developments in total colouring
- Graphs with chromatic number close to maximum degree
- scientific article; zbMATH DE number 819131 (Why is no real title available?)
- A sufficient condition for complete multipartite graphs to be of type 1
- The total chromatic number of regular graphs of high degree
- Total colorings of some classes of four regular circulant graphs
- On total chromatic number of complete multipartite graphs
- The structure of totally critical graphs of odd order
- The Total Chromatic Number of Graphs of High Minimum Degree
- Total coloring graphs with large maximum degree
- \([r,s,t]\)-colorings of graphs
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs
- The chromatic index of graphs of high maximum degree
- The total chromatic number of pseudo-Halin graphs with lower degree
- Total Colourings of Graphs
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
- scientific article; zbMATH DE number 98760 (Why is no real title available?)
- An extension of Vizing's theorem
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs
- On the total chromatic number of the direct product of cycles and complete graphs
This page was built for publication: The total chromatic number of graphs having large maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686156)