The 1 , 2 , 3-Conjecture And 1 , 2-Conjecture For Sparse Graphs

The 1, 2, 3-Conjecture states that the edges of a graph without isolated edges can be labeled from {1, 2, 3} so that the sums of labels at adjacent vertices are distinct. The 1, 2-Conjecture states that if vertices also receive labels and the vertex label is added to the sum of its incident edge lab...

Full description

Bibliographic Details

Published in:	Discussiones Mathematicae Graph Theory
Main Authors:	Cranston Daniel W., Jahanbekam Sogol, West Douglas B.
Format:	Article
Language:	English
Published:	University of Zielona Góra 2014-11-01
Subjects:	1 2 3-conjecture 2-conjecture reducible configuration discharging method.
Online Access:	https://doi.org/10.7151/dmgt.1768