Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
DOI10.1016/J.TCS.2013.01.015zbMATH Open1261.05023OpenAlexW2086272539MaRDI QIDQ1945929FDOQ1945929
Authors: Jian Chang, Yong-Ga A, Huijuan Wang, Jian-Liang Wu 
Publication date: 17 April 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.015
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cited In (15)
- Minimum total coloring of planar graph
- Total colorings of planar graphs with sparse triangles
- Total coloring of planar graphs without chordal 7-cycles
- Total coloring of planar graphs with 7-cycles containing at most two chords
- Total coloring of planar graphs with maximum degree 8
- Total colorings-a survey
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8
- Total coloring of planar graphs without chordal short cycles
- Total coloring of planar graphs without short cycles
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- A note on the minimum total coloring of planar graphs
- Minimum total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
- Title not available (Why is that?)
- Total coloring of planar graphs without some adjacent cycles
This page was built for publication: Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945929)
