Total colorings of planar graphs with sparse short cycles

DOI10.3969/J.ISSN.1001-8735.2020.02.001MaRDI QIDQ5127735zbMATH OpenFDO

Authors Jian Chang

Publication date 27 October 2020

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-8735.2020.02.001

zbMATH Keywords

cycleplanar graphtotal coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Total colorings of planar graphs with maximum degree 6 and without adjacent chordal 6-cycles
• Total chromatic number of planar graphs with few short cycles
• Total coloring of planar graphs without short cycles
• Total coloring of planar graphs without 6-cycles
• Total colorings of planar graphs without chordal 6-cycles

Cited in

(7)

• On total colorings of some special 1-planar graphs
• Short proofs of coloring theorems on planar graphs
• Hamiltonicity and generalised total colourings of planar graphs
• Total chromatic number of planar graphs with few short cycles
• Total coloring of planar graphs without chordal short cycles
• The total coloring of planar graphs with a few 3-faces incidents with vertex
• Hunting a type 2 fullerene nanodisc

This page was built for publication: Total colorings of planar graphs with sparse short cycles

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