Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
From MaRDI portal
Publication:1656911
DOI10.7151/dmgt.2058zbMath1392.05045OpenAlexW2794083341WikidataQ130055350 ScholiaQ130055350MaRDI QIDQ1656911
Lin Sun, Bing Wang, Jian Liang Wu
Publication date: 10 August 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2058
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total coloring of embedded graphs with maximum degree at least seven
- Minimum total coloring of planar graph
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Total colorings of planar graphs with maximum degree at least 8
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- The total coloring of a multigraph with maximal degree 4
- The total chromatic number of any multigraph with maximum degree five is at most seven
- List edge and list total colourings of multigraphs
- Total coloring of planar graphs with maximum degree \(7\)
- 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
This page was built for publication: Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
