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

Near 2-factorizations of 2Kn: Cycles of even length

โœ Scribed by James Burling; Katherine Heinrich

Book ID
105309501
Publisher
Springer Japan
Year
1989
Tongue
English
Weight
520 KB
Volume
5
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Cycles of even length in graphs
Cycles of even length in graphs
โœ J.A Bondy; M Simonovits ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB
On bipartite 2-factorizations of kn โˆ’ I
On bipartite 2-factorizations of kn โˆ’ I and the Oberwolfach problem
โœ Darryn Bryant; Peter Danziger ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 180 KB

It is shown that if F 1 , F 2 , ...,F t are bipartite 2-regular graphs of order n and 1 , 2 , . . . , t are positive integers such that 1 + 2 +โ€ข โ€ข โ€ข+ t = (n-2) / 2, 1 โ‰ฅ 3 is odd, and i is even for i = 2, 3, . . . , t, then there exists a 2-factorization of K n -I in which there are exactly i 2-facto

Cycles of length 2 modulo 3 in graphs
Cycles of length 2 modulo 3 in graphs
โœ Akira Saito ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 274 KB

Saito, A., Cycles of length 2 modulo 3 in graphs, Discrete Mathematics 101 (1992) 285-289. We prove that if a graph G of minimum degree at least 3 has no cycle of length 2 (mod 3), then G has an induced subgraph which is isomorphic to either K4 or Ks,s. The above result together with its relatively