Sciweavers

601 search results - page 3 / 121
» Edge-dominating cycles in graphs
Sort
View
96
Voted
APPML
2008
159views more  APPML 2008»
14 years 10 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho
69
Voted
RSA
2000
149views more  RSA 2000»
14 years 10 months ago
Hamilton cycles in random graphs and directed graphs
Colin Cooper, Alan M. Frieze
DM
1998
76views more  DM 1998»
14 years 10 months ago
Automorphism groups with cyclic commutator subgroup and Hamilton cycles
It has been shown that there is a Hamilton cycle in every connected Cayley graph on any group G whose commutator subgroup is cyclic of prime-power order. This note considers conne...
Edward Dobson, Heather Gavlas, Joy Morris, Dave Wi...
DAM
2000
121views more  DAM 2000»
14 years 10 months ago
Chordality and 2-factors in Tough Graphs
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved t...
Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, He...
85
Voted
COCO
2010
Springer
131views Algorithms» more  COCO 2010»
14 years 7 months ago
On the Matching Problem for Special Graph Classes
An even cycle in a graph is called nice by Lov
Thanh Minh Hoang