A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
From MaRDI portal
Publication:520529
DOI10.1007/s10114-016-5480-9zbMath1359.05047OpenAlexW2531438039MaRDI QIDQ520529
Hua Cai, Lin Sun, Jian Liang Wu
Publication date: 3 April 2017
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-016-5480-9
Related Items (2)
On total colorings of some special 1-planar graphs ⋮ 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
Cites Work
- Unnamed Item
- Unnamed Item
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- List edge and list total coloring of 1-planar graphs
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Determining the total colouring number is NP-hard
- Total colorings of planar graphs without small cycles
- The total chromatic number of any multigraph with maximum degree five is at most seven
- List edge and list total colourings of multigraphs
- On edge colorings of \(1\)-planar graphs
- On total colorings of 1-planar graphs
- Ein Sechsfarbenproblem auf der Kugel
- A note on total colorings of 1-planar graphs
- Total colorings of planar graphs without chordal 6-cycles
- On the total coloring of certain graphs
- Total chromatic number of planar graphs with maximum degree ten
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On the total coloring of planar graphs.
- Total colorings of planar graphs with large maximum degree
- On Total Chromatic Number of a Graph
This page was built for publication: A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
