𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonicity in balancedk-partite graphs

✍ Scribed by Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak

Publisher
Springer Japan
Year
1995
Tongue
English
Weight
538 KB
Volume
11
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-connectivity in p-partite graphs
Edge-connectivity in p-partite graphs
✍ Lutz Volkmann πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 166 KB

Let G = (V, €1 be a finite, simple p-partite graph with minimum degree 6 and edge-connectivity A. It is proved that if IVI d (2pS)/(p -1) -2 or in special cases that if IVI I ( 2 p 6 ) / ( p -1) -1, then A = S . It is further shown that this result is best possible.

Edge domination in complete partite grap
Edge domination in complete partite graphs
✍ Bor-Liang Chen; Hung-Lin Fu πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 416 KB

An edge dominating set in a graph G is a set of edges D such that every edge not in D is adjacent to an edge of D. An edge domatic partition of a graph C=(V, E) is a collection of pairwise-disjoint edge dominating sets of G whose union is E. The maximum size of an edge domatic partition of G is call

Hamiltonicity in graphs with fewP4's
Hamiltonicity in graphs with fewP4's
✍ W. HochstΓ€ttler; G. Tinhofer πŸ“‚ Article πŸ“… 1995 πŸ› Springer Vienna 🌐 English βš– 641 KB
Paths in r-partite self-complementary gr
Paths in r-partite self-complementary graphs
✍ T. Gangopadhyay; S.P. Rao Hebbare πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 683 KB

It is shown that. every connected bi-p.s.c, graphs G(2I of order p. with a bi-partite complementing permutation (bi-p.e.p) o" having mixed cycles, has a (p-3)-path and this result is best possible. Further. if the graph induced on each cycle of bi-p.c.p, of G( 2) is connected then G(2) has a hamilto