Homomorphism bounds for oriented planar graphs of given minimum girth
From MaRDI portal
Publication:367080
DOI10.1007/S00373-012-1202-YzbMATH Open1272.05055OpenAlexW1970463374MaRDI QIDQ367080FDOQ367080
Authors: Timothy H. Marshall 
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1202-y
Recommendations
Cites Work
- On the maximum average degree and the oriented chromatic number of a graph
- Every planar graph is 5-choosable
- An oriented coloring of planar graphs with girth at least five
- Good and semi-strong colorings of oriented planar graphs
- Colorings and girth of oriented planar graphs
- An oriented 7-colouring of planar graphs with girth at least 7
- On oriented graphs with certain extension properties.
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Homomorphism bounds for oriented planar graphs
- Oriented colorings of triangle-free planar graphs
- Oriented vertex and arc colorings of outerplanar graphs
- Oriented colorings of partial 2-trees
- A short list color proof of Grötzsch's theorem
- Oriented 5-coloring of sparse plane graphs
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
Cited In (14)
- On the oriented coloring of the disjoint union of graphs
- Homomorphisms and colourings of oriented graphs: an updated survey
- Homomorphism bounds for oriented planar graphs
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
- Planar orientations with low out-degree and compaction of adjacency matrices
- An oriented 6-coloring of planar graphs with girth at least 9
- Oriented coloring on recursively defined digraphs
- On universal graphs for planar oriented graphs of a given girth
- On oriented relative clique number
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth
- Homomorphism bounded classes of graphs
- A study on oriented relative clique number
This page was built for publication: Homomorphism bounds for oriented planar graphs of given minimum girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367080)
