Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
From MaRDI portal
Publication:965260
DOI10.1016/j.jctb.2009.06.002zbMath1209.05087MaRDI QIDQ965260
Michał Karoński, Florian Pfender, Maciej Kalkowski
Publication date: 21 April 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.06.002
Related Items
NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS, Antimagic Properties of Graphs with Large Maximum Degree, A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS, Total weight choosability of graphs, Algorithmic complexity of proper labeling problems, Distant irregularity strength of graphs, Neighbor sum distinguishing index of planar graphs, Colour-blind can distinguish colour pallets, Multiplicative vertex-colouring weightings of graphs, Total weight choosability of Cartesian product of graphs, The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs, A note on vertex colorings of plane graphs, Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz, Vertex-coloring 2-edge-weighting of graphs, The sigma chromatic number of a graph, Additive coloring of planar graphs, On total weight choosability of graphs, The edge-labeling and vertex-colors of \(K_n\), The complexity of the proper orientation number, A note on face coloring entire weightings of plane graphs, Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
Cites Work
