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

More on symplectic graphs modulo

โœ Scribed by Li, Fenggao; Wang, Kaishun; Guo, Jun


Book ID
122641448
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
269 KB
Volume
438
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Symplectic graphs modulo
โœ Li, Fenggao; Wang, Kaishun; Guo, Jun ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 227 KB
On graph decompositions modulo k
โœ A.D. Scott ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 153 KB

We prove that, for every integer k >~ 2, every graph has an edge-partition into 5k 2 log k sets, each of which is the edge-set of a graph with all degrees congruent to 1 mod k. This answers a question of Pyber. Pyber proved that every graph G has an edge-partition into four sets, each of which is

More on Moore graphs
โœ van Bon, John ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 142 KB
More on Graph Perturbations
โœ Rowlinson, P. ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Oxford University Press ๐ŸŒ English โš– 182 KB
More powerful closure operations on grap
โœ Yong-jin Zhu; Feng Tian; Xiao-tie Deng ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1017 KB

Zhu, Y.-J., F. Tian and X.-T. Deng, More powerful closure operations on graphs, Discrete Mathematics 87 (1991) 197-214. Bondy and Chvatal have observed the following result: G = (V, E) is a simple graph of order n. If uu $ E and d(u) + d(u) 2 n, then G is Hamiltonian iff G + uu is Hamiltonian. Thus,