Total coloring of planar graphs with 7-cycles containing at most two chords
From MaRDI portal
Publication:391771
DOI10.1016/J.TCS.2013.08.019zbMATH Open1305.05086OpenAlexW2005216870MaRDI QIDQ391771FDOQ391771
Authors: Renyu Xu, Jian-Liang Wu 
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.08.019
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Graph theory
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- 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 coloring of planar graphs without chordal short cycles
- Title not available (Why is that?)
- Total coloring of planar graphs of maximum degree eight
- Total coloring of planar graphs without adjacent short cycles
Cited In (9)
- Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
- Total coloring of planar graphs without chordal 7-cycles
- Total coloring of planar graphs with maximum degree 8
- Total colorings-a survey
- Total coloring of planar graphs without 7-cycles with chords
- Total coloring of planar graphs with maximum degree seven
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Total coloring of planar graphs with 7-cycles containing at most two chords
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391771)
