On weight choosabilities of graphs with bounded maximum average degree
From MaRDI portal
Publication:516900
DOI10.1016/J.DAM.2016.09.037zbMATH Open1358.05165OpenAlexW2535659266MaRDI QIDQ516900FDOQ516900
Authors: Jakub Przybyło, Mariusz Woźniak, André 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
Recommendations
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- Total weight choosability of graphs: towards the 1-2-3-conjecture
- A note on edge weight choosability of graphs
- Total weight choosability of graphs
- Total list weighting of graphs with bounded maximum average degree
1-2-3 conjecturecombinatorial Nullstellensatzdischarging methodmaximum average degree\(3\)-edge-weight choosability1-2-conjecture2-total weight choosability
Cites Work
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- On a \(1,2\) conjecture
- Title not available (Why is that?)
- On graph irregularity strength
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- A Tight Bound on the Irregularity Strength of Graphs
- Irregularity strength of regular graphs
- On decomposing regular graphs into locally irregular subgraphs
- On decomposing graphs of large minimum degree into locally irregular subgraphs
- A new upper bound for the irregularity strength of graphs
- Combinatorial Nullstellensatz
- On the irregularity strength of dense graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- Weight choosability of graphs
- Every graph is \((2,3)\)-choosable
- Title not available (Why is that?)
- Title not available (Why is that?)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
- How to Define an Irregular Graph
- Title not available (Why is that?)
Cited In (7)
- Weight choosability of graphs
- A note on edge weight choosability of graphs
- Sequence variations of the 1-2-3 conjecture and irregularity strength
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- Total list weighting of graphs with bounded maximum average degree
- An improved upper bound on edge weight choosability of graphs
- Total weight choosability of graphs with bounded maximum average degree
This page was built for publication: On weight choosabilities of graphs with bounded maximum average degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516900)
