Neighbor product distinguishing total colorings of 2-degenerate graphs

DOI10.1007/s10878-019-00455-5zbMath1434.05059OpenAlexW3152206451WikidataQ126992728 ScholiaQ126992728MaRDI QIDQ2292128

Chanjuan Liu, Jiguo Yu, En-Qiang Zhu

Publication date: 3 February 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00455-5

zbMATH Keywords

maximum degree2-degenerate graphneighbor product distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Multiplicative vertex-colouring weightings of graphs
• Neighbor product distinguishing total colorings
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• 1,2 conjecture-the multiplicative version
• Concise proofs for adjacent vertex-distinguishing total colorings
• On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• 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
• Combinatorial Nullstellensatz

This page was built for publication: Neighbor product distinguishing total colorings of 2-degenerate graphs