Total colorings of planar graphs with small maximum degree
From MaRDI portal
Publication:360968
zbMATH Open1270.05048MaRDI QIDQ360968FDOQ360968
Authors: Si-Feng Tian, Jian-Liang Wu, Bing Wang 
Publication date: 28 August 2013
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: http://math.usm.my/bulletin/html/vol36_3_21.html
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cited In (16)
- Randomly coloring planar graphs with fewer colors than the maximum degree
- Total colorings-a survey
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- On equitable colorings of sparse graphs
- The nil-graph of ideals of a commutative ring
- Total choosability of planar graphs with maximum degree 4
- Total chromatic number of planar graphs with few short cycles
- Total coloring of planar graphs with maximum degree \(7\)
- A note on the minimum total coloring of planar graphs
- Minimum total coloring of planar graphs with maximum degree 8
- Color degree condition for long rainbow paths in edge-colored graphs
- Total coloring of planar graphs without some chordal 6-cycles
- Acyclic total colorings of planar graphs.
- The total coloring of planar graphs with a few \(3\)-faces incidents with vertex
- Total coloring of recursive maximal planar graphs
- Total chromatic number of some families of graphs with maximum degree 3
This page was built for publication: Total colorings of planar graphs with small maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360968)
