Every graph is \((2,3)\)-choosable
From MaRDI portal
Publication:519997
DOI10.1007/s00493-014-3057-8zbMath1374.05106OpenAlexW2082218697MaRDI QIDQ519997
Publication date: 31 March 2017
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-014-3057-8
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)
Related Items
Graphs are \((1, \varDelta + 1)\)-choosable, Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability, Total weight choosability of cone graphs, Dense Eulerian graphs are \((1, 3)\)-choosable, Total weight choosability of graphs with bounded maximum average degree, Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable, Every nice graph is (1,5)-choosable, On the standard \((2,2)\)-conjecture, Total Weight Choosability of Trees, Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees, Distant total irregularity strength of graphs via random vertex ordering, A solution to the 1-2-3 conjecture, Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring, The 1-2-3 conjecture almost holds for regular graphs, The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs, From the 1-2-3 conjecture to the Riemann hypothesis, 2-connected chordal graphs and line graphs are \((1,5)\)-choosable, Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9, Neighbor sum distinguishing list total coloring of subcubic graphs, Permanent index of matrices associated with graphs, Total weight choosability of Mycielski graphs, On weight choosabilities of graphs with bounded maximum average degree, Total weight choosability of graphs: towards the 1-2-3-conjecture, Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz, Total weight choosability for Halin graphs, Weight choosability of oriented hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Total weight choosability of Cartesian product of graphs
- Permanent index of matrices associated with graphs
- A nowhere-zero point in linear mappings
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Colorings and orientations of graphs
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Vertex colouring edge partitions
- Weight choosability of graphs
- Combinatorial Nullstellensatz
- Total weight choosability of graphs
- Total weight choosability of graphs
- Marcinkiewicz integral with rough kernels
