scientific article; zbMATH DE number 6843221

MaRDI QIDQ4604121zbMATH OpenFDO

Authors Derong Sun, Lin Sun

Publication date 23 February 2018

zbMATH Keywords

planar graphcombinatorial nullstellensatzadjacent vertex distinguishing total coloringdischarging method

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The adjacent vertex distinguishing total coloring of planar graphs
• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• Adjacent-vertex-distinguishing total coloring of planar bipartite graphs
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four

Cited in

(6)

• Adjacent vertex-distinguishing total colorings of graphs with constraint conditions
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Adjacent vertex distinguishing total colorings of outer 1-planar graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• A note on adjacent vertex distinguishing colorings of graphs

This page was built for publication:

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