Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
type: Item
instance of: scholarly article
title: Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
zbMATH Open document ID: 1393.05231
author: Yu-Chang Liang
author: Tsai-Lien Wong
author: Xuding Zhu
published in: Discrete Mathematics
publication date: 2018-08-15T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6918720
zbMATH Keywords: 1-2-3 conjecture
zbMATH Keywords: total weighting
zbMATH Keywords: \((k, k^\prime)\)-choosable graphs
zbMATH Keywords: combinatorial Nullstellensatz
zbMATH Keywords: maximum average degree
MaRDI profile type: Publication
full work available at URL: j.disc.2018.06.036
OpenAlex ID: W2884237156
cites work: Vertex colouring edge partitions
cites work: Vertex-colouring edge-weightings
cites work: Combinatorial Nullstellensatz
cites work: A nowhere-zero point in linear mappings
cites work: Colorings and orientations of graphs
cites work: Weight choosability of graphs
cites work: The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
cites work: Edge weights and vertex colours
cites work: On weight choosabilities of graphs with bounded maximum average degree
cites work: Q3575472
cites work: Total weight choosability of graphs
cites work: On vertex-coloring 13-edge-weighting
cites work: Total weight choosability of Cartesian product of graphs
cites work: Q3060867
cites work: Every graph is \((2,3)\)-choosable
cites work: Permanent index of matrices associated with graphs
DOI: 10.1016/J.DISC.2018.06.036
description: scientific article; zbMATH DE number 6918720