Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor

DOI10.1016/J.DISC.2009.04.032zbMath1210.05084OpenAlexW2102761613MaRDI QIDQ1045075

Reza Naserasr, Yared Nigussie, Riste Škrekovski

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.032

zbMATH Keywords

graph coloringgraph minorgraph homomorphisms

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Finite duality for some minor closed classes ⋮ On low tree-depth decompositions ⋮ On the packing number of antibalanced signed simple planar graphs of negative girth at least 5 ⋮ Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees ⋮ Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) ⋮ Homomorphisms of Signed Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a new reformulation of Hadwiger's conjecture
• Homomorphisms and edge-colourings of planar graphs
• On Tutte's extension of the four-colour problem
• A short list color proof of Grötzsch's theorem
• Colored homomorphisms of colored mixed graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A not 3-choosable planar graph without 3-cycles
• Tree-depth, subgraph coloring and homomorphism bounds
• Cuts and bounds
• Über eine Eigenschaft der ebenen Komplexe
• Coloring graphs with fixed genus and girth
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor