𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A diagrammatic equation for oriented planar graphs

✍ Scribed by Razvan Gurau

Book ID
116798055
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
288 KB
Volume
839
Category
Article
ISSN
0550-3213

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Homomorphism bounds for oriented planar
Homomorphism bounds for oriented planar graphs
✍ T. H. Marshall πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 202 KB

## Abstract If ${\cal C}$ is a class of oriented graphs (directed graphs without opposite arcs), then an oriented graph is a __homomorphism bound__ for ${\cal C}$ if there is a homomorphism from each graph in ${\cal C}$ to __H__. We find some necessary conditions for a graph to be a homomorphism bo

A Characterization of Planar Oriented Gr
A Characterization of Planar Oriented Graphs
✍ Ulrich, John Wade πŸ“‚ Article πŸ“… 1970 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 832 KB
On universal graphs for planar oriented
On universal graphs for planar oriented graphs of a given girth
✍ O.V. Borodin; A.V. Kostochka; J. NeΕ‘etΕ™il; A. Raspaud; E. Sopena πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 662 KB

The oriented chromatic number o(H) of an oriented graph H is defined to be the minimum order of an oriented graph H' such that H has a homomorphism to H'. If each graph in a class ~ has a homomorphism to the same H', then H' is ~-universal. Let ~k denote the class of orientations of planar graphs wi