Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Total-coloring of Sparse Graphs with Maximum Degree 6

Total-coloring of Sparse Graphs with Maximum Degree 6 Given a graph G = (V, E) and a positive integer k, a k-total-coloring of G is a mapping φ: V⋃E → {1, 2, ⋯, k} such that no two adjacent or incident elements receive the same color. The central problem of the total-colorings is the Total Coloring Conjecture, which asserts that every graph of maximum degree Δ admits a (Δ+2)-total-coloring. More precisely, this conjecture has been verified for Δ ≤ 5, and it is still open when Δ = 6, even for planar graphs. Let mad(G) denote the maximum average degree of the graph G. In this paper, we prove that every graph G with Δ(G) = 6 and mad(G) < 23/5 admits an 8-total-coloring. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

Total-coloring of Sparse Graphs with Maximum Degree 6

Download PDF
9 pages

Loading next page...
 
/lp/springer-journals/total-coloring-of-sparse-graphs-with-maximum-degree-6-zmudLReqXx
Publisher
Springer Journals
Copyright
Copyright © The Editorial Office of AMAS & Springer-Verlag GmbH Germany 2021
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/s10255-021-1039-3
Publisher site
See Article on Publisher Site

Abstract

Given a graph G = (V, E) and a positive integer k, a k-total-coloring of G is a mapping φ: V⋃E → {1, 2, ⋯, k} such that no two adjacent or incident elements receive the same color. The central problem of the total-colorings is the Total Coloring Conjecture, which asserts that every graph of maximum degree Δ admits a (Δ+2)-total-coloring. More precisely, this conjecture has been verified for Δ ≤ 5, and it is still open when Δ = 6, even for planar graphs. Let mad(G) denote the maximum average degree of the graph G. In this paper, we prove that every graph G with Δ(G) = 6 and mad(G) < 23/5 admits an 8-total-coloring.

Journal

Acta Mathematicae Applicatae Sinica – Springer Journals

Published: Oct 1, 2021

Keywords: total-coloring; maximum average degree; discharging method; 05C15

References

  • On the total coloring of planar graphs
    Borodin, OV
  • An improvement of Hind’s upper bound on the Total Chromatic Number
    Chetwynd, A; Häggkvist, R
  • An upper bound for the total chromatic number
    Hind, H
  • The total coloring of a multigraph with maximum degree 4
    Kostochka, AV
  • The total chromatic number of any multigraph with maximum degree five is at most seven
    Kostochka, AV
  • On total colourings of graphs
    Mcdiarmid, C; Reed, B
  • A Bound on the Total Chromatic Number
    Molloy, M; Reed, B
  • Local condition for planar graphs of maximum degree 6 to be total 8-colorable
    Roussel, N
  • On total 9-coloring planar graphs of maximum degree seven
    Sanders, DP; Zhao, Y
  • On the total coloring of certain graphs
    Rosenfeld, M
  • Planar Graphs of Maximum Degree Seven are Class I
    Sanders, DP; Zhao, Y
  • On total coloring of a graph
    Vijayaditya, W
  • Some unsolved problems in graph theory
    Vizing, VG