Total colorings of embedded graphs with maximum degree seven and without 3-cycles adjacent to 5-cycles.

MaRDI QIDQ5206329zbMATH OpenFDO

Authors Bing Wang, Jian-Liang Wu

Publication date 18 December 2019

zbMATH Keywords

cycleembedded graphtotal coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Total coloring of embedded graphs with maximum degree at least seven
• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
• Total coloring of embedded graphs of maximum degree at least ten
• Total colorings of planar graphs without adjacent 5-cycles.
• Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic

Cited in

(5)

• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
• Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
• Total coloring of embedded graphs with maximum degree at least seven
• Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• Total coloring of embedded graphs of maximum degree at least ten

This page was built for publication: Total colorings of embedded graphs with maximum degree seven and without \(3\)-cycles adjacent to \(5\)-cycles.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206329)