Search Sciweavers | Sciweavers

122 search results - page 8 / 25

» On pancyclism in hamiltonian graphs

click to vote

APPML
2008

92views more APPML 2008»

On the domination number of Hamiltonian graphs with minimum degree six

13 years 7 months ago

Download www.ling.ohio-state.edu

Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the min...

Hua-Ming Xing, Johannes H. Hattingh, Andrew R. Plu...

claim paper

Read More »

click to vote

DM
2008

89views more DM 2008»

Primitive 2-factorizations of the complete graph

13 years 7 months ago

Download cdm.unimo.it

Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...

Giuseppe Mazzuoccolo

claim paper

Read More »

click to vote

SPAA
1993
ACM

114views Distributed And Parallel Com...» more SPAA 1993»

Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs

13 years 11 months ago

Download www.eecs.umich.edu

We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...

Philip D. MacKenzie, Quentin F. Stout

claim paper

Read More »

click to vote

MPC
1998
Springer

81views Mathematics» more MPC 1998»

Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach

13 years 11 months ago