On the standard \((2,2)\)-conjecture
From MaRDI portal
Publication:2662793
DOI10.1016/j.ejc.2020.103305zbMath1461.05103arXiv1911.00867OpenAlexW3120395228WikidataQ113875504 ScholiaQ113875504MaRDI QIDQ2662793
Publication date: 14 April 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.00867
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On decomposing graphs of large minimum degree into locally irregular subgraphs
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Decomposing graphs into a constant number of locally irregular subgraphs
- Every graph is \((2,3)\)-choosable
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- On vertex-coloring 13-edge-weighting
- A note on the weak \((2,2)\)-conjecture
- New bounds for locally irregular chromatic index of bipartite and subcubic graphs
- Multi-set neighbor distinguishing 3-edge coloring
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs
- Edge weights and vertex colours
- The 1-2-3 conjecture almost holds for regular graphs
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
- On decomposing regular graphs into locally irregular subgraphs
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Vertex colouring edge partitions
- Weight choosability of graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- The chromatic number of random graphs
- Graph colouring and the probabilistic method