Adjacent vertex-distinguishing total colorings of graphs with constraint conditions

MaRDI QIDQ3385757zbMATH OpenFDO

Authors Fuxiang Cui, Chao Yang, Hongbo Ye

Publication date 14 January 2021

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)

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

Cited in

(9)

• A note on adjacent vertex distinguishing colorings of graphs
• scientific article; zbMATH DE number 6501057 (Why is no real title available?)
• On the AVDTC of Sierpiński-type graphs
• scientific article; zbMATH DE number 7132838 (Why is no real title available?)
• Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints.
• scientific article; zbMATH DE number 5629882 (Why is no real title available?)
• Adjacent vertex distinguishing total coloring of graphs with lower average degree
• On proper total colorings of graphs with three constraints
• 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)