Strict neighbor-distinguishing total index of graphs

DOI10.1007/S10114-022-0593-9zbMath1487.05092OpenAlexW4210809191MaRDI QIDQ2131155

Jing Gu, Wei Fan Wang, Yi Qiao Wang

Publication date: 25 April 2022

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-022-0593-9

zbMATH Keywords

maximum degreestrict neighbor-distinguishing total indexstrict neighbor-distinguishing total-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• The adjacent vertex distinguishing total chromatic number
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Concise proofs for adjacent vertex-distinguishing total colorings
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• A note on graphs of class I
• On the AVDTC of 4-regular graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• The adjacent vertex distinguishing total coloring of planar graphs
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On adjacent-vertex-distinguishing total coloring of graphs
• Every planar map is four colorable

This page was built for publication: Strict neighbor-distinguishing total index of graphs