Minimum total coloring of planar graphs with maximum degree 8

DOI10.1007/S10878-023-01011-YMaRDI QIDQ2698022zbMATH OpenOpenAlexFDO

Authors Liting Wang, Weili Wu, Huijuan Wang

Publication date 14 April 2023

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-023-01011-y

zbMATH Keywords

maximum degreeminimum total coloringplanar graph

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Total coloring of planar graphs with maximum degree 8
• Total colorings of planar graphs with maximum degree at least 8
• Total coloring of planar graphs of maximum degree eight
• Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
• A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
• Total colorings of F₅-free planar graphs with maximum degree 8
• Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
• List edge and list total coloring of planar graphs with maximum degree 8
• A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
• Total colorings of planar graphs with small maximum degree

Cites work

• Determining the total colouring number is NP-hard
• On total 9-coloring planar graphs of maximum degree seven
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• 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 coloring of planar graphs with maximum degree 8
• Total coloring of planar graphs without adjacent short cycles
• Total colorings of planar graphs with large maximum degree
• Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
• Total colorings of planar graphs with maximum degree at least 8
• Total colorings of planar graphs without small cycles
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(6)

• Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
• Total coloring of planar graphs with maximum degree 8
• Minimum total coloring of planar graph
• Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• Total coloring of planar graphs of maximum degree eight

This page was built for publication: Minimum total coloring of planar graphs with maximum degree 8

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