Total coloring of planar graphs without chordal 7-cycles

DOI10.1007/s10114-015-4337-yzbMath1334.05036OpenAlexW2395256069MaRDI QIDQ272520

Publication date: 20 April 2016

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

Full work available at URL: https://doi.org/10.1007/s10114-015-4337-y

zbMATH Keywords

planar graph total coloring chordal 7-cycle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Total colorings-a survey

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Total coloring of planar graphs with 7-cycles containing at most two chords
Total coloring of planar graphs with maximum degree 8
Total colorings of \(F_5\)-free planar graphs with maximum degree 8
\((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles
A note on the total coloring of planar graphs without adjacent 4-cycles
Total colorings of planar graphs without intersecting 5-cycles
Minimum total coloring of planar graph
Total coloring of planar graphs without chordal short cycles
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
Total coloring of planar graphs without 6-cycles
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
A larger family of planar graphs that satisfy the total coloring conjecture
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
The total chromatic number of any multigraph with maximum degree five is at most seven
List edge and list total colourings of multigraphs
Total colourings of planar graphs with large girth
Total colourings of graphs
Total coloring of planar graphs with maximum degree \(7\)
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
Total coloring of planar graphs without some chordal 6-cycles
Total colorings of planar graphs without chordal 6-cycles
Total chromatic number of planar graphs with maximum degree ten
Total-Coloring of Plane Graphs with Maximum Degree Nine
On the total coloring of planar graphs.
On total 9-coloring planar graphs of maximum degree seven
Total colorings of planar graphs with large maximum degree
A note on total colorings of planar graphs without 4-cycles
Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
On Total Chromatic Number of a Graph

This page was built for publication: Total coloring of planar graphs without chordal 7-cycles