AL
A.V. Lusthof
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
1 records found
1
Two-Dimensional Nowhere- Zero Flows on Graphs
Determining Two-Dimensional Flow Numbers for Complete and Cubic Graphs
A nowhere-zero flow on a directed graph is a function that assigns a value to each edge such that each vertex has equal in- and outflow. This concept is generalized to d-dimensional nowhere-zero flows. The two-dimensional flow number of a graph is the smallest number r such that the graph has a two-dimensional nowhere-zero flow using only vectors with lengts between 1 and r-1.
In this paper, two-dimensional flow numbers are determined for several graphs. First, these are determined for all complete multipartite graphs. Second, flow triangulations are researched, and a flow triangulation is found for the Wagner graph. Furthermore, this research addresses the question whether a nice flow triangulation exists for all bipartite cubic graphs. Furthermore, optimization models are used to approximate two-dimensional flow numbers of certain graphs, including snarks.
...
In this paper, two-dimensional flow numbers are determined for several graphs. First, these are determined for all complete multipartite graphs. Second, flow triangulations are researched, and a flow triangulation is found for the Wagner graph. Furthermore, this research addresses the question whether a nice flow triangulation exists for all bipartite cubic graphs. Furthermore, optimization models are used to approximate two-dimensional flow numbers of certain graphs, including snarks.
...
A nowhere-zero flow on a directed graph is a function that assigns a value to each edge such that each vertex has equal in- and outflow. This concept is generalized to d-dimensional nowhere-zero flows. The two-dimensional flow number of a graph is the smallest number r such that the graph has a two-dimensional nowhere-zero flow using only vectors with lengts between 1 and r-1.
In this paper, two-dimensional flow numbers are determined for several graphs. First, these are determined for all complete multipartite graphs. Second, flow triangulations are researched, and a flow triangulation is found for the Wagner graph. Furthermore, this research addresses the question whether a nice flow triangulation exists for all bipartite cubic graphs. Furthermore, optimization models are used to approximate two-dimensional flow numbers of certain graphs, including snarks.
In this paper, two-dimensional flow numbers are determined for several graphs. First, these are determined for all complete multipartite graphs. Second, flow triangulations are researched, and a flow triangulation is found for the Wagner graph. Furthermore, this research addresses the question whether a nice flow triangulation exists for all bipartite cubic graphs. Furthermore, optimization models are used to approximate two-dimensional flow numbers of certain graphs, including snarks.