A totally ( + 1)-colorable 1-planar graph with girth at least five

DOI10.1007/S10114-016-5480-9MaRDI QIDQ520529zbMATH OpenOpenAlexFDO

Authors Lin Sun, Hua Cai, 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

zbMATH Keywords

girthtotal coloringdischarging method1-planar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On total colorings of some special 1-planar graphs
• On total colorings of 1-planar graphs
• scientific article; zbMATH DE number 6746684
• A note on total colorings of 1-planar graphs
• On edge colorings of 1-planar graphs without chordal 5-cycles.

Cites work

• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• A note on total colorings of 1-planar graphs
• Determining the total colouring number is NP-hard
• Ein Sechsfarbenproblem auf der Kugel
• Graph theory with applications
• List edge and list total coloring of 1-planar graphs
• List edge and list total colourings of multigraphs
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• On Total Chromatic Number of a Graph
• On edge colorings of \(1\)-planar graphs
• On the total coloring of certain graphs
• On the total coloring of planar graphs.
• On total colorings of 1-planar graphs
• Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total chromatic number of planar graphs with maximum degree ten
• Total colorings of planar graphs with large maximum degree
• Total colorings of planar graphs without chordal 6-cycles
• Total colorings of planar graphs without small cycles
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(7)

• A note on total colorings of 1-planar graphs
• 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
• A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
• On total colorings of 1-planar graphs
• (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
• On total colorings of some special 1-planar graphs
• scientific article; zbMATH DE number 6746684 (Why is no real title available?)

This page was built for publication: A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520529)