Homomorphism bounds for oriented planar graphs

DOI10.1002/JGT.20233MaRDI QIDQ5295497zbMATH OpenOpenAlexFDO

Authors 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

homomorphismhomomorphism boundoriented graphPaley tournamentplanar graphTromp graph

Mathematics Subject Classification ID

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

Recommendations

• Homomorphism bounds for oriented planar graphs of given minimum girth
• Homomorphism bounded classes of graphs
• Colorings and girth of oriented planar graphs
• An oriented colouring of planar graphs with girth at least 4
• Oriented colorings of partial 2-trees

Cited in

(26)

• An oriented coloring of planar graphs with girth at least five
• A note on antisymmetric flows in graphs
• Planar orientations with low out-degree and compaction of adjacency matrices
• On the impossibility of a generalization of the HOMFLY-polynomial to labelled oriented graphs
• Oriented incidence colourings of digraphs
• Pushable chromatic number of graphs with degree constraints
• Oriented cliques and colorings of graphs with low maximum degree
• Complexity dichotomy for oriented homomorphism of planar graphs with large girth
• Homomorphism bounded classes of graphs
• On homomorphisms of oriented graphs with respect to the push operation
• \(L(2,1)\)-labelings of some families of oriented planar graphs
• Cuts and bounds
• Walk-powers and homomorphism bounds of planar signed graphs
• Homomorphisms and colourings of oriented graphs: an updated survey
• Homomorphism bounds for oriented planar graphs of given minimum girth
• scientific article; zbMATH DE number 1137986 (Why is no real title available?)
• Bounds and extrema for classes of graphs and finite structures
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• Planar hypohamiltonian oriented graphs
• Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\)
• Oriented total-coloring of oriented graphs
• On coloring parameters of triangle-free planar (n, m)-graphs
• Oriented colouring graphs of bounded degree and degeneracy
• Homomorphisms of (n,m)-graphs with respect to generalised switch
• Colourings of oriented connected cubic graphs
• Oriented colorings of partial 2-trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295497)