On weight choosabilities of graphs with bounded maximum average degree
From MaRDI portal
Publication:516900
DOI10.1016/j.dam.2016.09.037zbMath1358.05165OpenAlexW2535659266MaRDI QIDQ516900
Jakub Przybyło, Mariusz Woźniak, Andre Raspaud
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.037
1-2-conjecture1-2-3 conjecturecombinatorial Nullstellensatzdischarging methodmaximum average degree\(3\)-edge-weight choosability2-total weight choosability
Related Items
Total weight choosability of graphs with bounded maximum average degree, Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On decomposing graphs of large minimum degree into locally irregular subgraphs
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
- Every graph is \((2,3)\)-choosable
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Irregularity strength of regular graphs
- Edge weights and vertex colours
- On decomposing regular graphs into locally irregular subgraphs
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- How to Define an Irregular Graph
- A New Upper Bound for the Irregularity Strength of Graphs
- Weight choosability of graphs
- Combinatorial Nullstellensatz
- A Tight Bound on the Irregularity Strength of Graphs
- On graph irregularity strength
- On the Irregularity Strength of Dense Graphs
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
