On vertex-coloring 13-edge-weighting

From MaRDI portal
Publication:1001315

DOI10.1007/S11464-008-0041-XzbMath1191.05048OpenAlexW2017934789MaRDI QIDQ1001315

Qinglin Yu, Tao Wang

Publication date: 17 February 2009

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-008-0041-x




Related Items (40)

A note on adjacent vertex distinguishing colorings of graphsGroup sum chromatic number of graphsGraphs are \((1, \varDelta + 1)\)-choosableA note on the weak \((2,2)\)-conjectureVertex-coloring 3-edge-weighting of some graphsWeak and strong versions of the 1-2-3 conjecture for uniform hypergraphsA relaxed case on 1-2-3 conjectureNeighbor sum distinguishing index of \(K_4\)-minor free graphsA note on 1-2-3 conjecture for Halin graphsNeighbor sum distinguishing edge colorings of graphs with bounded maximum average degreeThe 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjectureDense Eulerian graphs are \((1, 3)\)-choosableThe edge-labeling and vertex-colors of \(K_n\)Total weight choosability of graphs with bounded maximum average degreeGraphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosableEvery nice graph is (1,5)-choosableOn the standard \((2,2)\)-conjectureVertex-coloring 2-edge-weighting of graphsDistant irregularity strength of graphs with bounded minimum degreeTotal Weight Choosability of TreesColourings of graphs by labellingsOn the total versions of 1-2-3-conjecture for graphs and hypergraphsOn the neighbour sum distinguishing index of graphs with bounded maximum average degreeA solution to the 1-2-3 conjectureOn offset Hamilton cycles in random hypergraphsA note on face coloring entire weightings of plane graphsThe 1-2-3 conjecture almost holds for regular graphsThe \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphsA note on vertex colorings of plane graphsNEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHSTotal weight choosability of Mycielski graphsVertex-coloring edge-weightings: towards the 1-2-3-conjectureLinear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphsDistant sum distinguishing index of graphsDecomposability of graphs into subgraphs fulfilling the 1-2-3 conjectureEquitable neighbour-sum-distinguishing edge and total colouringsTotal weight choosability for Halin graphsOn the Neighbor Sum Distinguishing Index of Planar GraphsUnnamed ItemOn decomposing regular graphs into locally irregular subgraphs




Cites Work




This page was built for publication: On vertex-coloring 13-edge-weighting