𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bound for the alternation number of a torus knot

✍ Scribed by Taizo Kanenobu

Book ID
108286587
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
247 KB
Volume
157
Category
Article
ISSN
0166-8641

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new upper bound for the harmonious chr
A new upper bound for the harmonious chromatic number
✍ Edwards, Keith πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 200 KB πŸ‘ 2 views

A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general

An upper bound for the path number of a
An upper bound for the path number of a graph
✍ Alan Donald πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ LovΓ‘sz has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≀ 1/2 __u__ + __g__ ‐ 1 ≀ __n__ ‐ 1, where __n__ is the total numbe