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

Pack Editable - Copie

โœ Scribed by David, Patneaude

Book ID
108025982
Year
2006
Tongue
French
Weight
4 MB
Series
Epitaphe Road
Category
Fiction

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Copie
Copie
โœ silence, mortel ๐Ÿ“‚ Fiction ๐ŸŒ French โš– 878 KB
Copie
Copie
โœ Absurde, Mort ๐Ÿ“‚ Fiction ๐ŸŒ French โš– 3 MB
The Editable Web
The Editable Web
โœ Berzal, F. ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› IEEE ๐ŸŒ English โš– 181 KB
Maximum packings ofKnwith copies ofK4โˆ’ e
Maximum packings ofKnwith copies ofK4โˆ’ e
โœ D. G. Hoffman; C. C. Lindner; Martin J. Sharry; Anne Penfold Street ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Springer ๐ŸŒ English โš– 919 KB
Packing of three copies of a graph
Packing of three copies of a graph
โœ Wang, Hong; Sauer, Norbert ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 460 KB ๐Ÿ‘ 1 views

A graph of order n is said to be 3-placeable if there are three edge-disjoint copies of this graph in K,,. An ( n , n -1)-graph is a graph of order n with n -1 edges. In this paper w e characterize all the (n, n -1)-graphs which contain no cycles of length 3 or 4 and which are 3-placeable.