scholarly journals Circular flow number of highly edge connected signed graphs

2015 ◽  
Vol 112 ◽  
pp. 93-103 ◽  
Author(s):  
Xuding Zhu
Keyword(s):  
Signed Graphs ◽  
Flow Number ◽  
Circular Flow

Perfect Matching Index versus Circular Flow Number of a Cubic Graph

2021 ◽  
Vol 35 (2) ◽  
pp. 1287-1297
Author(s):  
Edita Máčajová ◽  
Martin Škoviera
Keyword(s):  
Perfect Matching ◽  
Cubic Graph ◽  
Flow Number ◽  
Circular Flow ◽  
Matching Index

scholarly journals Circular flow number of generalized Blanuša snarks

2013 ◽  
Vol 313 (8) ◽  
pp. 975-981 ◽  
Author(s):  
Robert Lukot’ka
Keyword(s):  
Flow Number ◽  
Circular Flow

scholarly journals The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem

2016 ◽  
Vol 7 (2–3) ◽  
pp. 453-479
Author(s):  
Louis Esperet ◽  
Giuseppe Mazzuoccolo ◽  
Michael Tarsi
Keyword(s):  
Recognition Problem ◽  
Flow Number ◽  
Circular Flow

The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four

COMBINATORICA ◽  
2002 ◽  
Vol 22 (3) ◽  
pp. 455-459 ◽  
Author(s):  
Anna Galluccio ◽  
Luis A. Goddyn
Keyword(s):  
Connected Graph ◽  
Flow Number ◽  
Circular Flow

scholarly journals Circular flow on signed graphs

2011 ◽  
Vol 101 (6) ◽  
pp. 464-479 ◽  
Author(s):  
Andre Raspaud ◽  
Xuding Zhu
Keyword(s):  
Signed Graphs ◽  
Circular Flow

scholarly journals Flows in Signed Graphs with Two Negative Edges

10.37236/4458 ◽  
2018 ◽  
Vol 25 (2) ◽  
Author(s):  
Edita Rollová ◽  
Michael Schubert ◽  
Eckhard Steffen
Keyword(s):  
Signed Graph ◽  
Cubic Graphs ◽  
Cubic Graph ◽  
Signed Graphs ◽  
Flow Number ◽  
Edge Connectivity ◽  
Cyclic Edge Connectivity

The presented paper studies the flow number $F(G,\sigma)$ of flow-admissible signed graphs $(G,\sigma)$ with two negative edges. We restrict our study to cubic graphs, because for each non-cubic signed graph $(G,\sigma)$ there is a set of cubic graphs obtained from $(G,\sigma)$ such that the flow number of $(G,\sigma)$ does not exceed the flow number of any of the cubic graphs. We prove that $F(G,\sigma) \leq 6$ if $(G,\sigma)$ contains a bridge, and $F(G,\sigma) \leq 7$ in general. We prove better bounds, if there is a cubic graph $(H,\sigma_H)$ obtained from $(G,\sigma)$ which satisfies some additional conditions. In particular, if $H$ is bipartite, then $F(G,\sigma) \leq 4$ and the bound is tight. If $H$ is $3$-edge-colorable or critical or if it has a sufficient cyclic edge-connectivity, then $F(G,\sigma) \leq 6$. Furthermore, if Tutte's $5$-Flow Conjecture is true, then $(G,\sigma)$ admits a nowhere-zero $6$-flow endowed with some strong properties.

scholarly journals Treelike Snarks

10.37236/6008 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Marién Abreu ◽  
Tomáš Kaiser ◽  
Domenico Labbate ◽  
Giuseppe Mazzuoccolo
Keyword(s):  
Infinite Family ◽  
Double Cover ◽  
Perfect Matchings ◽  
Computer Assisted ◽  
Flow Number ◽  
Circular Flow

We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family  of such snarks, generalising an example provided by Hägglund. We  construct another infinite family, arising from a generalisation in a different direction. The proof that this family has the requested property is computer-assisted. In addition, we prove that the snarks from this family (we call them treelike snarks) have circular flow number $\phi_C (G)\ge5$ and admit a 5-cycle double cover.

scholarly journals Computational results and new bounds for the circular flow number of snarks

2020 ◽  
Vol 343 (10) ◽  
pp. 112026
Author(s):  
Jan Goedgebeur ◽  
Davide Mattiolo ◽  
Giuseppe Mazzuoccolo
Keyword(s):  
Computational Results ◽  
Flow Number ◽  
Circular Flow

scholarly journals Determining the Circular Flow Number of a Cubic Graph

10.37236/9607 ◽  
2021 ◽  
Vol 28 (1) ◽  
Author(s):  
Robert Lukoťka
Keyword(s):  
Polynomial Algorithms ◽  
Cubic Graphs ◽  
Cubic Graph ◽  
Flow Number ◽  
Circular Flow ◽  
Bridgeless Graph

A circular nowhere-zero $r$-flow on a bridgeless graph $G$ is an orientation of the edges and an assignment of real values from $[1, r-1]$ to the edges in such a way that the sum of incoming values equals the sum of outgoing values for every vertex. The circular flow number, $\phi_c(G)$, of $G$ is the infimum over all values $r$ such that $G$ admits a nowhere-zero $r$-flow. A flow has its underlying orientation. If we subtract the number of incoming and the number of outgoing edges for each vertex, we get a mapping $V(G) \to \mathbb{Z}$, which is its underlying balanced valuation. In this paper we describe efficient and practical polynomial algorithms to turn balanced valuations and orientations into circular nowhere zero $r$-flows they underlie with minimal $r$. Using this algorithm one can determine the circular flow number of a graph by enumerating balanced valuations. For cubic graphs we present an algorithm that determines $\phi_c(G)$ in case that $\phi_c(G) \leqslant 5$ in time $O(2^{0.6\cdot|V(G)|})$. If $\phi_c(G) > 5$, then the algorithm determines that $\phi_c(G) > 5$ and thus the graph is a counterexample to Tutte's $5$-flow conjecture. The key part is a procedure that generates all (not necessarily proper) $2$-vertex-colourings without a monochromatic path on three vertices in $O(2^{0.6\cdot|V(G)|})$ time. We also prove that there is at most $2^{0.6\cdot|V(G)|}$ of them.

scholarly journals A unified approach to construct snarks with circular flow number 5

2020 ◽  
Author(s):  
Jan Goedgebeur ◽  
Davide Mattiolo ◽  
Giuseppe Mazzuoccolo
Keyword(s):  
Unified Approach ◽  
Flow Number ◽  
Circular Flow
Sign in / Sign up

Export Citation Format

Share Document