Total-coloring of sparse graphs with maximum degree 6

DOI10.1007/S10255-021-1039-3zbMATH Open1482.05098OpenAlexW3207085077MaRDI QIDQ2240657FDOQ2240657

Jichang Wu, Guanghui Wang, Fei Jing, Yu-Lin Chang

Publication date: 4 November 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-021-1039-3

Recommendations

• Acyclic coloring of graphs with maximum degree at most six
• Acyclic vertex coloring of graphs of maximum degree six
• Total colorings of planar graphs with maximum degree 6 and without adjacent chordal 6-cycles
• 19-linear-colorable graphs with maximum degree 6
• Sparse \(H\)-colourable graphs of bounded maximum degree
• Acyclic 6-colouring of graphs with maximum degree 5 and small maximum average degree
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
• A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
• Total coloring of plane graphs with maximum degree six and without intersecting triangles and 4-cycles
• Strong edge-colorings of sparse graphs with large maximum degree

zbMATH Keywords

discharging methodtotal-coloringmaximum average degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The total chromatic number of any multigraph with maximum degree five is at most seven
• On total colourings of graphs
• On the total coloring of certain graphs
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph
• Local condition for planar graphs of maximum degree 6 to be total 8-colorable
• Planar graphs of maximum degree seven are Class I
• The total coloring of a multigraph with maximal degree 4
• A bound on the total chromatic number
• An upper bound for the total chromatic number
• An Improvement of Hind's Upper Bound on the Total Chromatic Number

Cited In (3)

• Total colorings-a survey
• Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
• 19-linear-colorable graphs with maximum degree 6

This page was built for publication: Total-coloring of sparse graphs with maximum degree 6

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