Total coloring of planar graphs without adjacent chordal 6-cycles
From MaRDI portal
Publication:2410046
DOI10.1007/S10878-016-0063-3zbMATH Open1378.05075OpenAlexW2514159070MaRDI QIDQ2410046FDOQ2410046
Authors: Yanyan Li 
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0063-3
Recommendations
- Total colorings of planar graphs with maximum degree 6 and without adjacent chordal 6-cycles
- Total coloring of planar graphs without some chordal 6-cycles
- Total colorings of planar graphs without chordal 6-cycles
- Total coloring of planar graphs without 6-cycles
- Total colorings of planar graphs without adjacent triangles
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Graph theory with applications
- Minimum total coloring of planar graph
- The total chromatic number of any multigraph with maximum degree five is at most seven
- 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
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- 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 8 and without adjacent triangles are 9-totally-colorable
- Total coloring of planar graphs without short cycles
- Neighbor sum distinguishing total colorings of planar graphs
- On the neighbor sum distinguishing total coloring of planar graphs
- Neighbor sum distinguishing total choosability of planar graphs
- A note on the minimum total coloring of planar graphs
- Total colorings of planar graphs with maximum degree at least 8
- Total coloring of planar graphs without adjacent short cycles
Cited In (7)
- A 6-chromatic odd-distance graph in the plane
- Total colorings-a survey
- Total coloring of planar graphs without some chordal 6-cycles
- Total colorings of planar graphs with maximum degree 6 and without adjacent chordal 6-cycles
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
- Hunting a type 2 fullerene nanodisc
- Total colorings of planar graphs without 6-cycles and adjacent 5-cycles
This page was built for publication: Total coloring of planar graphs without adjacent chordal 6-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2410046)
