On decomposing graphs of large minimum degree into locally irregular subgraphs
From MaRDI portal
Publication:286116
zbMath1338.05237arXiv1508.01129MaRDI QIDQ286116
Publication date: 20 May 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.01129
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
A Note on the Locally Irregular Edge Colorings of Cacti, 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, On locally irregular decompositions of subcubic graphs, Decomposing degenerate graphs into locally irregular subgraphs, 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, Local irregularity conjecture vs. cacti, On weight choosabilities of graphs with bounded maximum average degree, Algorithmic complexity of weakly semiregular partitioning and the representation number, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Edge weights and vertex colours
- On decomposing regular graphs into locally irregular subgraphs
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Vertex colouring edge partitions
- Graph colouring and the probabilistic method
