On weight choosabilities of graphs with bounded maximum average degree

DOI10.1016/J.DAM.2016.09.037MaRDI QIDQ516900zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

1-2-3 conjecturecombinatorial Nullstellensatzdischarging methodmaximum average degree\(3\)-edge-weight choosability1-2-conjecture2-total weight choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

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

Cites work

• scientific article; zbMATH DE number 4142086 (Why is no real title available?)
• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• scientific article; zbMATH DE number 866055 (Why is no real title available?)
• scientific article; zbMATH DE number 867641 (Why is no real title available?)
• A Tight Bound on the Irregularity Strength of Graphs
• A new upper bound for the irregularity strength of graphs
• Combinatorial Nullstellensatz
• Degree constrained subgraphs
• Edge weights and vertex colours
• Every graph is \((2,3)\)-choosable
• How to Define an Irregular Graph
• Irregularity strength of regular graphs
• Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
• On a \(1,2\) conjecture
• On decomposing graphs of large minimum degree into locally irregular subgraphs
• On decomposing regular graphs into locally irregular subgraphs
• On graph irregularity strength
• On the irregularity strength of dense graphs
• The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
• Total weight choosability of graphs
• Total weight choosability of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Vertex-colouring edge-weightings
• Weight choosability of graphs

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)