𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On factorable degree sequences

✍ Scribed by A Ramachandra Rao; S.B Rao


Book ID
107883998
Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
437 KB
Volume
13
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Signed graph factors and degree sequence
✍ Dean Hoffman; Heather Jordon πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 106 KB

## Abstract For a signed graph __G__ and function $f: V(G) \rightarrow Z$, a signed __f__‐factor of __G__ is a spanning subgraph __F__ such that sdeg~__F__~(__Ο…__) = __f__(__Ο…__) for every vertex __Ο…__ of __G__, where sdeg(__Ο…__) is the number of positive edges incident with __v__ less the number o

Polynomials: Factorable or Non-Factorabl
✍ Doyne Holder πŸ“‚ Article πŸ“… 1962 πŸ› School Science and Mathematics Association 🌐 English βš– 164 KB
On Highly Factorable Numbers
✍ Jun Kyo Kim πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 287 KB

For a positive integer n, let f (n) be the number of multiplicative partions of n. We say that a nutural number n is highly factorable if f (m)< f (n) for all m, 1 ma j then f (np j Γ‚p i ) f (n). Using this fact, we prove the conjecture of Canfield, Erdo s, and Pormerance: for each fixed k, if n is

Degree Sequences and the Existence ofk-F
✍ D. Bauer; H. J. Broersma; J. van den Heuvel; N. Kahl; E. Schmeichel πŸ“‚ Article πŸ“… 2011 πŸ› Springer Japan 🌐 English βš– 289 KB
On oriented 2-factorable graphs
✍ Linfan Mao; Feng Tian πŸ“‚ Article πŸ“… 2005 πŸ› Springer-Verlag 🌐 English βš– 199 KB