Every nice graph is (1,5)-choosable
Publication:2171030
DOI10.1016/J.JCTB.2022.08.006zbMath1497.05104arXiv2104.05410OpenAlexW4293999390MaRDI QIDQ2171030
Publication date: 23 September 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.05410
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Other combinatorial number theory (11B75) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Signed and weighted graphs (05C22)
Related Items (2)
Cites Work
- Unnamed Item
- Total weight choosability of cone graphs
- Permanent index of matrices associated with graphs
- Every graph is \((2,3)\)-choosable
- A nowhere-zero point in linear mappings
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- On vertex-coloring 13-edge-weighting
- Graphs are \((1, \varDelta + 1)\)-choosable
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- Edge weights and vertex colours
- Total weight choosability of graphs: towards the 1-2-3-conjecture
- Weight choosability of graphs with maximum degree 4
- From the 1-2-3 conjecture to the Riemann hypothesis
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable
- Vertex-coloring 3-edge-weighting of some graphs
- Total weight choosability of graphs with bounded maximum average degree
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Bounding the weight choosability number of a graph
- Weight choosability of graphs
- Combinatorial Nullstellensatz
- Total Weight Choosability of Trees
- Total weight choosability of graphs
- Total weight choosability of graphs
This page was built for publication: Every nice graph is (1,5)-choosable
