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

Computing large matchings in planar graphs with fixed minimum degree

โœ Scribed by Robert Franke; Ignaz Rutter; Dorothea Wagner

Book ID
108281658
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
257 KB
Volume
412
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the fixed edge of planar graphs with
On the fixed edge of planar graphs with minimum degree five
โœ Baogang Xu; Hongbing Fan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB

An edge e of a finite and simple graph G is called a fixed edge of G if G -e + e' ~G implies e' = e. In this paper, we show that planar graphs with minimum degree 5 contain fixed edges, from which we prove that a class of planar graphs with minimum degree one is edge reconstructible.

Cycle lengths in graphs with large minim
Cycle lengths in graphs with large minimum degree
โœ V. Nikiforov; R. H. Schelp ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 114 KB ๐Ÿ‘ 1 views

## Abstract Our main result is the following theorem. Let __k__โ€‰โ‰ฅโ€‰2 be an integer, __G__ be a graph of sufficiently large order __n__, and __ฮด__(__G__)โ€‰โ‰ฅโ€‰__n__/__k__. Then: __G__ contains a cycle of length __t__ for every even integer __t__โ€‰โˆˆโ€‰[4, __ฮด__(__G__)โ€‰+โ€‰1]. If __G__ is nonbipartite then