Total coloring of claw-free planar graphs
From MaRDI portal
Publication:2151210
DOI10.7151/dmgt.2300zbMath1497.05092OpenAlexW3005705791MaRDI QIDQ2151210
Publication date: 1 July 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2300
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Total-chromatic number and chromatic index of dually chordal graphs
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- The total coloring of a multigraph with maximal degree 4
- Extending matchings in claw-free graphs
- 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 graphs
- Clique-transversal sets and clique-coloring in planar graphs
- On the total coloring of certain graphs
- 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
- A note on total colorings of planar graphs without 4-cycles
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- On Total Chromatic Number of a Graph
- Edge and total coloring of interval graphs
This page was built for publication: Total coloring of claw-free planar graphs