On vertex-coloring 13-edge-weighting
From MaRDI portal
Publication:1001315
DOI10.1007/S11464-008-0041-XzbMath1191.05048OpenAlexW2017934789MaRDI QIDQ1001315
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
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (40)
A note on adjacent vertex distinguishing colorings of graphs ⋮ Group sum chromatic number of graphs ⋮ Graphs are \((1, \varDelta + 1)\)-choosable ⋮ A note on the weak \((2,2)\)-conjecture ⋮ Vertex-coloring 3-edge-weighting of some graphs ⋮ Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs ⋮ A relaxed case on 1-2-3 conjecture ⋮ Neighbor sum distinguishing index of \(K_4\)-minor free graphs ⋮ A note on 1-2-3 conjecture for Halin graphs ⋮ Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree ⋮ The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture ⋮ Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ The edge-labeling and vertex-colors of \(K_n\) ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable ⋮ Every nice graph is (1,5)-choosable ⋮ On the standard \((2,2)\)-conjecture ⋮ Vertex-coloring 2-edge-weighting of graphs ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ Total Weight Choosability of Trees ⋮ Colourings of graphs by labellings ⋮ On the total versions of 1-2-3-conjecture for graphs and hypergraphs ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ A solution to the 1-2-3 conjecture ⋮ On offset Hamilton cycles in random hypergraphs ⋮ A note on face coloring entire weightings of plane graphs ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs ⋮ A note on vertex colorings of plane graphs ⋮ NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS ⋮ Total weight choosability of Mycielski graphs ⋮ Vertex-coloring edge-weightings: towards the 1-2-3-conjecture ⋮ Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs ⋮ Distant sum distinguishing index of graphs ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ Equitable neighbour-sum-distinguishing edge and total colourings ⋮ Total weight choosability for Halin graphs ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ Unnamed Item ⋮ On decomposing regular graphs into locally irregular subgraphs
Cites Work
This page was built for publication: On vertex-coloring 13-edge-weighting
