𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Snarks with given real flow numbers

✍ Scribed by Robert Lukot'ka; Martin Škoviera

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
172 KB
Volume
68
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

We show that for each rational number r such that 4<r ≤ 5 there exist infinitely many cyclically 4-edge-connected cubic graphs of chromatic index 4 and girth at least 5-that is, snarks-whose flow number equals r. This answers a question posed by Pan and Zhu [Construction of graphs with given circular flow numbers, J Graph Theory 43 [2003], 304-318].

📜 SIMILAR VOLUMES

Construction of graphs with given circul
Construction of graphs with given circular flow numbers
✍ Zhishi Pan; Xuding Zhu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB 👁 1 views

## Abstract Suppose __r__ ≥ 2 is a real number. A proper __r__‐flow of a directed multi‐graph $\vec {G}=(V, E)$ is a mapping $f: E \to R$ such that (i) for every edge $e \in E$, $1 \leq |f(e)| \leq r-1$; (ii) for every vertex ${v} \in V$, $\sum \_{e \in E^{+(v)}}f(e) - \sum \_{e \in E^{-(v)}}f(e) =

On connectivity in graphs with given cli
On connectivity in graphs with given clique number
✍ Angelika Hellwig; Lutz Volkmann 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 1 views

## Abstract We consider finite, undirected, and simple graphs __G__ of order __n__(__G__) and minimum degree δ(__G__). The connectivity κ(__G__) for a connected graph __G__ is defined as the minimum cardinality over all vertex‐cuts. If κ(__G__) < δ(__G__), then Topp and Volkmann 7 showed in 1993 f

Real flow number and the cycle rank of a
Real flow number and the cycle rank of a graph
✍ Robert Lukot'ka; Martin Škoviera 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract This article establishes a relationship between the real (circular) flow number of a graph and its cycle rank. We show that a connected graph with real flow number __p__/__q__ + 1, where __p__ and __q__ are two relatively prime numbers must have cycle rank at least __p__ + __q__ − 1. A

The maximum interval number of graphs wi
The maximum interval number of graphs with given genus
✍ Edward R. Scheinerman 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 1 views

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investiga