The bounds of the Smarandachely adjacent vertex total colorings of some kinds of 3-regular graphs

zbMATH Open1324.05060MaRDI QIDQ5260054FDOQ5260054

Author name not available (Why is that?)

Publication date: 29 June 2015

Recommendations

• The smarandachely adjacent vertex total coloring of a kind of 3-regular graphs.
• scientific article; zbMATH DE number 5952700
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• scientific article; zbMATH DE number 7132838

zbMATH Keywords

3-regular graphSmarandachely adjacent vertex total coloringSmarandachely adjacent vertex total chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (2)

• Title not available (Why is that?)
• Strict neighbor-distinguishing total index of graphs

This page was built for publication: The bounds of the Smarandachely adjacent vertex total colorings of some kinds of 3-regular graphs

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