Total colorings of graphs of order 2n having maximum degree 2n-2
From MaRDI portal
Publication:1196563
DOI10.1007/BF02350630zbMATH Open0771.05034OpenAlexW2000598303MaRDI QIDQ1196563FDOQ1196563
Authors: Bor-Liang Chen, Hung-Lin Fu 
Publication date: 16 January 1993
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02350630
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
Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (11)
- Recent results on the total chromatic number
- Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1
- Total chromatic number of graphs of odd order and high degree
- Generalization of two results of Hilton on total-colourings of a graph
- Title not available (Why is that?)
- The total chromatic number of graphs of even order and high degree
- Totally critical even order graphs
- Total colorings of complete multipartite graphs using amalgamations
- On total coloring of some classes of regular graphs
- Title not available (Why is that?)
- 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)
