Premium
Antisymmetric flows on planar graphs
Author(s) -
Marshall T. H.
Publication year - 2006
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20154
Subject(s) - antisymmetric relation , planar graph , mathematics , combinatorics , friendship graph , outerplanar graph , planar , tournament , graph , discrete mathematics , planar straight line graph , book embedding , 1 planar graph , graph power , pathwidth , line graph , computer science , computer graphics (images) , mathematical physics
We prove that every oriented planar graph admits a homomorphism to the Paley tournament P 271 and hence that every oriented planar graph has an antisymmetric flow number and a strong oriented chromatic number of at most 271. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 200–210, 2006
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom