𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound for the connectivity of directed Euler tour transformation graphs

✍ Scribed by Xueliang Li

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
327 KB
Volume
163
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A lower bound for the circumference of a
A lower bound for the circumference of a graph
✍ Nathan Linial πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 423 KB

Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o

An upper bound for the radius of a 3-con
An upper bound for the radius of a 3-connected graph
✍ Jochen Harant πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 286 KB

For a 3-connected graph with radius r containing n vertices, in [1] r < n/4 + O(log n) was proved and r < n/4 + const was conjectured. Here we prove r < n/4 + 8. Let G be a simple 3-connected finite graph on n vertices with vertex set V(G) and edge set E(G). For X, YE V(G) we denote by d(X, Y) the

A topological lower bound for the circul
A topological lower bound for the circular chromatic number of Schrijver graphs
✍ Meunier, FrΓ©dΓ©ric (author) πŸ“‚ Article πŸ“… 2005 πŸ› Wiley-Liss Inc. 🌐 English βš– 66 KB πŸ‘ 1 views

## Abstract In this paper, we prove that the Kneser graphs defined on a ground set of __n__ elements, where __n__ is even, have their circular chromatic numbers equal to their chromatic numbers. Β© 2005 Wiley Periodicals, Inc. J Graph Theory 49: 257–261, 2005