Homomorphism bounds for oriented planar graphs

DOI10.1002/jgt.20233zbMath1120.05039OpenAlexW4238276859MaRDI QIDQ5295497

Timothy H. Marshall

Publication date: 30 July 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20233

zbMATH Keywords

homomorphismoriented graphplanar graphhomomorphism boundPaley tournamentTromp graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (13)

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ Oriented incidence colourings of digraphs ⋮ On homomorphisms of oriented graphs with respect to the push operation ⋮ Homomorphism bounds for oriented planar graphs of given minimum girth ⋮ Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) ⋮ \(L(2,1)\)-labelings of some families of oriented planar graphs ⋮ Pushable chromatic number of graphs with degree constraints ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ Oriented colorings of partial 2-trees ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ An oriented coloring of planar graphs with girth at least five ⋮ A note on antisymmetric flows in graphs ⋮ Colourings of oriented connected cubic graphs

This page was built for publication: Homomorphism bounds for oriented planar graphs