Edge weights and vertex colours
From MaRDI portal
Publication:1826962
DOI10.1016/j.jctb.2003.12.001zbMath1042.05045OpenAlexW2101489005MaRDI QIDQ1826962
Tomasz Łuczak, Michał Karoński, Andrew G. Thomason
Publication date: 6 August 2004
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.2003.12.001
Related Items (only showing first 100 items - show all)
On Proper Labellings of Graphs with Minimum Label Sum ⋮ 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 ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ The edge-labeling and vertex-colors of \(K_n\) ⋮ On locally irregular decompositions of subcubic graphs ⋮ Distance irregularity strength of graphs with pendant vertices ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ Decomposing degenerate graphs into locally irregular subgraphs ⋮ An injective version of the 1-2-3 conjecture ⋮ On the standard \((2,2)\)-conjecture ⋮ On the semi-proper orientations of graphs ⋮ Upper bounds on distance vertex irregularity strength of some families of graphs ⋮ Complexity of the improper twin edge coloring of graphs ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ Total edge irregularity strength of accordion graphs ⋮ A note on breaking small automorphisms in graphs ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ The neighbour sum distinguishing relaxed edge colouring ⋮ Total Weight Choosability of Trees ⋮ Proper orientations and proper chromatic number ⋮ Locally irregular edge-coloring of subcubic graphs ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ A proof of the multiplicative 1-2-3 conjecture ⋮ Local irregularity conjecture for 2-multigraphs versus cacti ⋮ On the total versions of 1-2-3-conjecture for graphs and hypergraphs ⋮ Neighbour sum distinguishing edge-weightings with local constraints ⋮ On decomposing multigraphs into locally irregular submultigraphs ⋮ The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures ⋮ Weight choosability of graphs with maximum degree 4 ⋮ A notion of vertex equitability for proper labellings ⋮ On inducing degenerate sums through 2-labellings ⋮ A solution to the 1-2-3 conjecture ⋮ On the role of 3's for the 1-2-3 conjecture ⋮ The complexity of the proper orientation number ⋮ On minimizing the maximum color for the 1-2-3 conjecture ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ A note on face coloring entire weightings of plane graphs ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ Total weight choosability of graphs ⋮ From the 1-2-3 conjecture to the Riemann hypothesis ⋮ On the role of 3s for the 1--2--3 conjecture ⋮ NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS ⋮ A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS ⋮ On colour-blind distinguishing colour pallets in regular graphs ⋮ On the complexity of determining the irregular chromatic index of a graph ⋮ Degree constrained subgraphs ⋮ Vertex colouring edge partitions ⋮ An oriented version of the 1-2-3 conjecture ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ Weight choosability of graphs ⋮ An improved upper bound on neighbor expanded sum distinguishing index ⋮ On twin edge colorings of graphs ⋮ A lower bound and several exact results on the \(d\)-lucky number ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Total weight choosability for Halin graphs ⋮ Unnamed Item ⋮ Decomposing split graphs into locally irregular graphs ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ Weight choosability of oriented hypergraphs ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ The 1-2-3-Conjecture for Hypergraphs ⋮ Edge weights and vertex colours: minimizing sum count ⋮ Highly Irregular ⋮ \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number ⋮ Unnamed Item ⋮ On the total-neighbor-distinguishing index by sums ⋮ On decomposing regular graphs into locally irregular subgraphs ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs ⋮ A note on adjacent vertex distinguishing colorings of graphs ⋮ Group sum chromatic number of graphs ⋮ Total edge irregularity strength of generalized prism ⋮ Graphs are \((1, \varDelta + 1)\)-choosable ⋮ Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ On decomposing graphs of large minimum degree into locally irregular subgraphs ⋮ Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ A note on the weak \((2,2)\)-conjecture ⋮ Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture ⋮ Total weight choosability of cone graphs ⋮ On a list variant of the multiplicative 1-2-3 conjecture ⋮ New bounds for locally irregular chromatic index of bipartite and subcubic graphs ⋮ Neighbour-distinguishing labellings of families of graphs ⋮ The 1,2-conjecture for powers of cycles ⋮ The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture ⋮ Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ Graphs with vertex-coloring and detectable 2-edge-weighting ⋮ Decomposing graphs into a constant number of locally irregular subgraphs ⋮ Decomposing oriented graphs into six locally irregular oriented graphs ⋮ Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable ⋮ Going wide with the 1-2-3 conjecture ⋮ Every nice graph is (1,5)-choosable ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles ⋮ Local antimagic orientation of graphs ⋮ Additive list coloring of planar graphs with given girth
Cites Work
This page was built for publication: Edge weights and vertex colours
