Total coloring of planar graphs without adjacent chordal 6-cycles
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0063-3
Abstract: A total coloring of a graph G is a coloring such that no two adjacent or incident elements receive the same color. In this field there is a famous conjecture, named Total Coloring Conjecture, saying… read more here.
Keywords: total coloring; planar; without adjacent; chordal cycles ... See more keywords