A note on neighbour-distinguishing regular graphs total-weighting

zbMath1159.05046MaRDI QIDQ1010694

Jakub Przybyło

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129772

zbMATH Keywords

regular graphsvertex colouringproper colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

The 1,2-conjecture for powers of cycles ⋮ Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring ⋮ On total weight choosability of graphs ⋮ On decomposing regular graphs into locally irregular subgraphs

This page was built for publication: A note on neighbour-distinguishing regular graphs total-weighting