On total colorings of 1-planar graphs
Preprint
Abstract
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- List edge and list total coloring of 1-planar graphsFrontiers of Mathematics in China, 2012
- On edge colorings of 1-planar graphs without adjacent trianglesInformation Processing Letters, 2012
- On edge colorings of 1-planar graphsInformation Processing Letters, 2011
- Coupled choosability of plane graphsJournal of Graph Theory, 2008
- On total 9-coloring planar graphs of maximum degree sevenJournal of Graph Theory, 1999
- The total chromatic number of any multigraph with maximum degree five is at most sevenDiscrete Mathematics, 1996
- A new proof of the 6 color theoremJournal of Graph Theory, 1995
- The total coloring of a multigraph with maximal degree 4Discrete Mathematics, 1977
- On the total coloring of certain graphsIsrael Journal of Mathematics, 1971
- Ein Sechsfarbenproblem auf der KugelAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1965