On the adjacent vertex distinguishing total chromatic number of outer plane graph.

zbMATH Open1289.05180MaRDI QIDQ2864477FDOQ2864477

Authors: Zhiwen Wang, Li-hong Yan, Jaeun Lee, Zhongfu Zhang 

Publication date: 6 December 2013

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Adjacent vertex distinguishing total colorings of outer 1-planar graphs
• The adjacent vertex distinguishing total coloring of planar graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree

zbMATH Keywords

outerplanar graphadjacent vertex-distinguishing total coloring

Mathematics Subject Classification ID

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

Cited In (5)

• Adjacent-vertex-distinguishing total coloring of planar bipartite graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• The adjacent vertex distinguishing total chromatic number
• Title not available (Why is that?)

This page was built for publication: On the adjacent vertex distinguishing total chromatic number of outer plane graph.

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