๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Generating cycles in graphs with at most one end

โœ Scribed by Henning Bruhn

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
81 KB
Volume
42
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

Answering a question of Halin, we prove that in a 3โ€connected graph with at most one end the cycle space is generated by induced nonโ€separating cycles. ยฉ 2003 Wiley Periodicals, Inc. J Graph Theory 42: 342โ€“349, 2003

๐Ÿ“œ SIMILAR VOLUMES

Maximal independent sets in graphs with
Maximal independent sets in graphs with at most r cycles
โœ Goh Chee Ying; Koh Khee Meng; Bruce E. Sagan; Vincent R. Vatter ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 127 KB ๐Ÿ‘ 2 views

## Abstract We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with __n__ vertices and at most __r__ cycles. The second family is all graphs of the first family which are connected and satisfy __n__โ€‰โ‰ฅโ€‰3__r__. ยฉ 2006 Wiley Period

Maximal and maximum independent sets in
Maximal and maximum independent sets in graphs with at most r cycles
โœ Bruce E. Sagan; Vincent R. Vatter ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 236 KB ๐Ÿ‘ 2 views

## Abstract Let __m__(__G__) denote the number of maximal independent sets of vertices in a graph __G__ and let __c__(__n__,__r__) be the maximum value of __m__(__G__) over all connected graphs with __n__ vertices and at most __r__ cycles. A theorem of Griggs, Grinstead, and Guichard gives a formul

The chromaticity of complete bipartite g
The chromaticity of complete bipartite graphs with at most one edge deleted
โœ C. P. Teo; K. M. Koh ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 364 KB ๐Ÿ‘ 1 views

## Abstract Let __K(p, q), p โ‰ค q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ โ‰ฅ 2; and (2) the graph __K(p, q)__ โ€ __e__ obtained by del

On the density of 2-colorable 3-graphs i
On the density of 2-colorable 3-graphs in which any four points span at most two edges
โœ Klas Markstrรถm; John Talbot ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 161 KB ๐Ÿ‘ 1 views

## Abstract Let __ex__~2~(__n, K__) be the maximum number of edges in a 2โ€colorable __K__โ€free 3โ€graph (where __K__={123, 124, 134} ). The 2โ€chromatic Turรกn density of __K__ is \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$\pi\_{2}({K}\_{4}^-) =lim\_{{n}\to \infty} {ex}\_{2}