On decomposing regular graphs into locally irregular subgraphs
From MaRDI portal
Publication:2349960
DOI10.1016/j.ejc.2015.02.031zbMath1315.05105OpenAlexW2078162819MaRDI QIDQ2349960
Olivier Baudon, Jakub Przybyło, Mariusz Woźniak, Julien Bensmail
Publication date: 18 June 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2015.02.031
Related Items
A Note on the Locally Irregular Edge Colorings of Cacti, On decomposing graphs of large minimum degree into locally irregular subgraphs, A note on the weak \((2,2)\)-conjecture, New bounds for locally irregular chromatic index of bipartite and subcubic graphs, Decomposing graphs into a constant number of locally irregular subgraphs, Decomposing oriented graphs into six locally irregular oriented graphs, On locally irregular decompositions of subcubic graphs, Going wide with the 1-2-3 conjecture, Decomposing degenerate graphs into locally irregular subgraphs, An injective version of the 1-2-3 conjecture, On the standard \((2,2)\)-conjecture, A generalization of Faudree–Lehel conjecture holds almost surely for random graphs, Locally irregular edge-coloring of subcubic graphs, Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees, Local irregularity conjecture for 2-multigraphs versus cacti, On decomposing multigraphs into locally irregular submultigraphs, The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures, Local irregularity conjecture vs. cacti, A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs, On a directed variation of the 1-2-3 and 1-2 conjectures, On weight choosabilities of graphs with bounded maximum average degree, Algorithmic complexity of weakly semiregular partitioning and the representation number, On the complexity of determining the irregular chromatic index of a graph, An oriented version of the 1-2-3 conjecture, Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture, Decomposing split graphs into locally irregular graphs, Decomposing split graphs into locally irregular graphs, Graph classes with locally irregular chromatic index at most 4, On proper labellings of graphs with minimum label sum
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- On vertex-coloring 13-edge-weighting
- A note on neighbour-distinguishing regular graphs total-weighting
- On the independence and chromatic numbers of random regular graphs
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Vertex colouring edge partitions
- How to Define an Irregular Graph
- A New Upper Bound for the Irregularity Strength of Graphs
- Highly irregular graphs
- Irregular Assignments of Trees and Forests
- A Tight Bound on the Irregularity Strength of Graphs
- On graph irregularity strength
- On the Irregularity Strength of Dense Graphs
- Graph colouring and the probabilistic method
