Adjacent vertex distinguishing total coloring of P_n and C_n double graph

zbMATH Open1140.05306MaRDI QIDQ5454005FDOQ5454005

Authors: Ting Zhang, Muchun Li, B. Xu, Ergen Liu, Chao Zuo 

Publication date: 3 April 2008

Recommendations

• scientific article; zbMATH DE number 5812180
• Adjacent vertex distinguishing total coloring of a class of graphs
• On adjacent vertex-distinguishing-equitable total coloring of double graphs
• On a number of adjacent vertex distinguishing VI-total coloring of double graphs
• On a number of adjacent vertex distinguishing I-total colorings of a double graph

zbMATH Keywords

adjacent vertex distinguishing total coloringtotal chromatic numberdouble graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)

Cited In (10)

• Title not available (Why is that?)
• The adjacent vertex distinguishing total coloring of extended Petersen graphs
• On adjacent vertex-distinguishing-equitable total coloring of double graphs
• On a number of adjacent vertex distinguishing VI-total coloring of double graphs
• Vertex-distinguishing total coloring of some complement double graphs
• Adjacent vertex distinguishing total coloring of a class of graphs
• On a number of adjacent vertex distinguishing I-total colorings of a double graph
• Adjacent vertex-distinguishing VE-total coloring of the double graph and the Mycielski graph of some graphs
• On the vertex incidence-adjacent vertex-distinguishing total coloring of \(D(F_n)\) and \(D(W_n)\)
• On the adjacent vertex-distinguishing total coloring of some generalized Petersen graphs

This page was built for publication: Adjacent vertex distinguishing total coloring of \(P_n\) and \(C_n\) double graph

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