Premium
A theorem on integer flows on cartesian products of graphs
Author(s) -
Imrich Wilfried,
Škrekovski Riste
Publication year - 2003
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.10100
Subject(s) - cartesian product , mathematics , bipartite graph , combinatorics , product (mathematics) , integer (computer science) , discrete mathematics , zero (linguistics) , graph , flow (mathematics) , geometry , computer science , linguistics , philosophy , programming language
It is shown that the Cartesian product of two nontrivial connected graphs admits a nowhere‐zero 4‐flow. If both factors are bipartite, then the product admits a nowhere‐zero 3‐flow. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 93–98, 2003
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