Vertex coloring of graphs by total 2-weightings

DOI10.1007/S00373-016-1712-0zbMath1353.05058OpenAlexW2465775933MaRDI QIDQ503639

Jonathan Hulgan, Kenta Ozeki, Kiyoshi Yoshimoto, Jenő Lehel

Publication date: 13 January 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1712-0

zbMATH Keywords

vertex coloringtotal weightingadjacent-vertex distinguishing

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (2)

Neighbour-distinguishing labellings of families of graphs ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• On irregular total labellings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Concise proofs for adjacent vertex-distinguishing total colorings
• Edge weights and vertex colours
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Vertex-colouring edge-weightings
• On adjacent-vertex-distinguishing total coloring of graphs
• How to Increase Robustness of Capable-to-Promise

This page was built for publication: Vertex coloring of graphs by total 2-weightings