Sparse \(H\)-colourable graphs of bounded maximum degree
type: Item
instance of: scholarly article
title: Sparse \(H\)-colourable graphs of bounded maximum degree
zbMATH Open document ID: 1055.05053
author: Hossein Hajiabolhassan
author: Xuding Zhu
published in: Graphs and Combinatorics
publication date: 2004-12-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 2121772
zbMATH Keywords: uniquely \(H\)-colourable graphs
zbMATH Keywords: girth
zbMATH Keywords: bounded maximum degree
MaRDI profile type: Publication
full work available at URL: s00373-003-0542-z
OpenAlex ID: W1992841364
DOI: 10.1007/S00373-003-0542-Z
Recommended article: \(r\)-hued coloring of sparse graphs
Recommended article: Strong edge-colorings of sparse graphs with large maximum degree
Recommended article: Colouring graphs with sparse neighbourhoods: bounds and applications
Recommended article: A Brooks-type result for sparse critical graphs
Recommended article: The complexity of \(H\)-colouring of bounded degree graphs
Recommended article: Sparse colour-critical hypergraphs
Recommended article: \((k,1)\)-coloring of sparse graphs
Recommended article: Bounded max-colorings of graphs
Recommended article: Bounded Max-colorings of Graphs
Recommended article: Q4427278
description: scientific article; zbMATH DE number 2121772