Adjacent vertex-distinguishing total colorings of graphs with constraint conditions

zbMATH Open1463.05163MaRDI QIDQ3385757FDOQ3385757

Authors: Fuxiang Cui, Chao Yang, Hongbo Ye 

Publication date: 14 January 2021

Recommendations

• On proper total colorings of graphs with three constraints
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• scientific article; zbMATH DE number 6843221
• Concise proofs for adjacent vertex-distinguishing total colorings
• Adjacent vertex distinguishing total coloring in split graphs

zbMATH Keywords

total coloringmaximal planar graphsvertex distinguishing total colorings

Mathematics Subject Classification ID

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

Cited In (9)

• A note on adjacent vertex distinguishing colorings of graphs
• On the AVDTC of Sierpiński-type graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints.
• Title not available (Why is that?)
• On proper total colorings of graphs with three constraints
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• Adjacent vertex distinguishing colorings by sum of sparse graphs

This page was built for publication: Adjacent vertex-distinguishing total colorings of graphs with constraint conditions

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