Vertex colouring edge partitions
From MaRDI portal
Publication:2485946
DOI10.1016/j.jctb.2005.01.001zbMath1074.05031OpenAlexW2063812540MaRDI QIDQ2485946
Louigi Addario-Berry, Ketan Dalal, R. E. L. Aldred, Bruce A. Reed
Publication date: 5 August 2005
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.2005.01.001
Related Items (51)
Graphs are \((1, \varDelta + 1)\)-choosable ⋮ On decomposing graphs of large minimum degree into locally irregular subgraphs ⋮ New bounds for locally irregular chromatic index of bipartite and subcubic graphs ⋮ Vertex-coloring 3-edge-weighting of some graphs ⋮ A relaxed case on 1-2-3 conjecture ⋮ Neighbour-distinguishing labellings of families of graphs ⋮ 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 ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable ⋮ Colorful edge decomposition of graphs: some polynomial cases ⋮ On the standard \((2,2)\)-conjecture ⋮ Complexity of the improper twin edge coloring of graphs ⋮ Vertex-coloring 2-edge-weighting of graphs ⋮ A note on breaking small automorphisms in graphs ⋮ The sigma chromatic number of a graph ⋮ Algorithmic complexity of proper labeling problems ⋮ Can colour-blind distinguish colour palettes? ⋮ Distant set distinguishing edge colourings of graphs ⋮ Colour-blind can distinguish colour pallets ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ A proof of the multiplicative 1-2-3 conjecture ⋮ Multi-set neighbor distinguishing 3-edge coloring ⋮ Computation of lucky number of planar graphs is NP-hard ⋮ Multiplicative vertex-colouring weightings of graphs ⋮ The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures ⋮ A solution to the 1-2-3 conjecture ⋮ Total weight choosability of Cartesian product of graphs ⋮ Distant total sum distinguishing index of graphs ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ Total weight choosability of graphs ⋮ A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs ⋮ Permanent index of matrices associated with graphs ⋮ Graphs with multiplicative vertex-coloring 2-edge-weightings ⋮ Every graph is \((2,3)\)-choosable ⋮ On colour-blind distinguishing colour pallets in regular graphs ⋮ The neighbour-sum-distinguishing edge-colouring game ⋮ A note on edge weightings inducing proper vertex colorings ⋮ Edge colouring by total labellings ⋮ On the complexity of determining the irregular chromatic index of a graph ⋮ 1,2 conjecture-the multiplicative version ⋮ Degree constrained subgraphs ⋮ An oriented version of the 1-2-3 conjecture ⋮ Lucky labelings of graphs ⋮ Weight choosability of graphs ⋮ On twin edge colorings of graphs ⋮ Total weight choosability for Halin graphs ⋮ Further evidence towards the multiplicative 1-2-3 conjecture ⋮ A new type of edge-derived vertex coloring ⋮ On decomposing regular graphs into locally irregular subgraphs
Cites Work
This page was built for publication: Vertex colouring edge partitions
