Adjacent vertex-distinguishing I-total coloring of C_n^2

zbMATH Open1424.05096MaRDI QIDQ4625504FDOQ4625504

Authors: Y. Y. Li 

Publication date: 22 February 2019

Recommendations

• Adjacent vertex-distinguishing \(I\)-total colorings of \(P_n\square C_m\)
• Adjacent vertex-distinguishing \(I\)-total coloring of corona graphs \(C_m\bullet C_n\) and \(C_m \bullet K_n\)
• Adjacent vertex-distinguishing \(I\)-total coloring of graphs \(M(C_n)\) and \(M(W_n)\)
• On a number of adjacent vertex distinguishing I-total colorings of a double graph
• Adjacent vertex-distinguishing \(I\)-total coloring of some crown graphs of path

zbMATH Keywords

power graphadjacent vertex-distinguishing \(I\)-total chromatic numberadjacent vertex-distinguishing \(I\)-total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a number of adjacent vertex distinguishing I-total colorings of a double graph
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Adjacent vertex-distinguishing \(I\)-total coloring of \(C_n^2\)

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