𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomials with graphs of maximum length

✍ Scribed by N. Sh. Zagirov

Book ID
110614100
Publisher
SP MAIK Nauka/Interperiodica
Year
1999
Tongue
English
Weight
436 KB
Volume
65
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximum chromatic polynomials of 2-conne
Maximum chromatic polynomials of 2-connected graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 345 KB πŸ‘ 1 views

## Abstract In this paper we obtain chromatic polynomials __P(G__; Ξ») of 2‐connected graphs of order __n__ that are maximum for positive integer‐valued arguments Ξ» ≧ 3. The extremal graphs are cycles __C__~__n__~ and these graphs are unique for every Ξ» ≧ 3 and __n__ β‰  5. We also determine max{__P(

Maximum packings of the complete graph w
Maximum packings of the complete graph with uniform length cycles
✍ Daniel Horsley πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 86 KB

In this paper we find the maximum number of pairwise edgedisjoint m-cycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≀ m ≀ n.