Choosability of the square of planar subcubic graphs with large girth
type: Item
instance of: scholarly article
title: Choosability of the square of planar subcubic graphs with large girth
zbMATH Open document ID: 1213.05084
author: Frédéric Havet
published in: Discrete Mathematics
publication date: 2009-06-19T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5566748
zbMATH Keywords: list colouring
zbMATH Keywords: square of a graph
zbMATH Keywords: bounded density
zbMATH Keywords: planar graph
MaRDI profile type: Publication
full work available at URL: j.disc.2007.12.100
OpenAlex ID: W2025662810
cites work: List-coloring the square of a subcubic graph
cites work: A solution to a colouring problem of P. Erdős
cites work: Choosability conjectures and multicircuits
DOI: 10.1016/J.DISC.2007.12.100
description: scientific article; zbMATH DE number 5566748