Results 241 to 250 of about 17,014 (265)

Antisymmetric flows on planar graphs

Journal of Graph Theory, 2006
AbstractWe prove that every oriented planar graph admits a homomorphism to the Paley tournament P271 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.
openaire   +1 more source

On multicommodity flows in planar graphs

Networks, 1984
AbstractOkamura and Seymour recently proved two properties of multicommodity flows in undirected planar networks where all the sources and the sinks are on a common face of the underlying graph. One is that a feasible solution is guaranteed whenever each cut's capacity is at least as large as the cut's demand.
openaire   +1 more source

Edge colorings and circular flows on regular graphs

Journal of Graph Theory, 2022
Davide Mattiolo, Eckhard Steffen
exaly  

Flows on metric graphs with general boundary conditions

Journal of Mathematical Analysis and Applications, 2022
Klaus-Jochen Engel, Marjeta Kramar Fijavz   +1 more
exaly  

Flows on Signed Graphs without Long Barbells

SIAM Journal on Discrete Mathematics, 2020
Cun-Quan Zhang, Rong Luo, You Lu
exaly  

Stochastic flows on metric graphs

Electronic Journal of Probability, 2014
Hatem Hajri, Olivier Raimond
exaly  

Bounded‐excess flows in cubic graphs

Journal of Graph Theory, 2020
Michael Tarsi
exaly  

Nowhere-zero flows on tensor products of signed graphs

Discrete Mathematics, 2023
exaly  

Earliest arrival flows on series-parallel graphs

Networks, 2011
Stefan Ruzika
exaly  

Nowhere-zero 3-flows in dihedral Cayley graphs

Information Processing Letters, 2011
Xiangwen Li
exaly