Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
type: Item
instance of: scholarly article
title: Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
zbMATH Open document ID: 1210.05084
author: Reza Naserasr
author: Yared Nigussie
author: Riste Škrekovski
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5648118
zbMATH Keywords: graph coloring
zbMATH Keywords: graph homomorphisms
zbMATH Keywords: graph minor
MaRDI profile type: Publication
full work available at URL: j.disc.2009.04.032
OpenAlex ID: W2102761613
cites work: Q5422499
cites work: Q4947393
cites work: Coloring graphs with fixed genus and girth
cites work: Combinatorial Relations and Chromatic Graphs
cites work: Q4828516
cites work: Homomorphisms and edge-colourings of planar graphs
cites work: On a new reformulation of Hadwiger's conjecture
cites work: Cuts and bounds
cites work: Tree-depth, subgraph coloring and homomorphism bounds
cites work: Colored homomorphisms of colored mixed graphs
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: On Tutte's extension of the four-colour problem
cites work: A short list color proof of Grötzsch's theorem
cites work: A not 3-choosable planar graph without 3-cycles
cites work: Über eine Eigenschaft der ebenen Komplexe
DOI: 10.1016/J.DISC.2009.04.032
description: scientific article; zbMATH DE number 5648118