Antisymmetric flows on planar graphs

T. H. Marshall

doi:10.1002/jgt.20154

ScienceGate Book Chapters

JOURNAL ARTICLE

Antisymmetric flows on planar graphs

T. H. Marshall

Year: 2006 Journal: Journal of Graph Theory Vol: 52 (3)Pages: 200-210 Publisher: Wiley

DOI: 10.1002/jgt.20154

Get Full-Text PDF Get Analytical Report

Abstract

Abstract 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

Keywords:

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

Metrics

Cited By

0.93

FWCI (Field Weighted Citation Impact)

Refs

0.73

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Geometric Analysis and Curvature Flows

Physical Sciences → Mathematics → Applied Mathematics

Navier-Stokes equation solutions

Physical Sciences → Mathematics → Applied Mathematics

Mathematical Dynamics and Fractals

Physical Sciences → Mathematics → Mathematical Physics

Antisymmetric flows on planar graphs

Abstract

Metrics

Topics

Related Documents

Antisymmetric flows and strong oriented coloring of planar graphs

A note on antisymmetric flows in graphs

Antisymmetric flows and strong colourings of oriented graphs

Multicommodity flows in planar graphs

Circular Flows in Planar Graphs