Sciweavers

601 search results - page 6 / 121
» Edge-dominating cycles in graphs
Sort
View
IPL
2010
247views more  IPL 2010»
13 years 8 months ago
The Floyd-Warshall algorithm on graphs with negative cycles
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
Stefan Hougardy
JGT
2010
91views more  JGT 2010»
13 years 8 months ago
Choosability of toroidal graphs without short cycles
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...
Leizhen Cai, Weifan Wang, Xuding Zhu
CPC
2000
82views more  CPC 2000»
13 years 9 months ago
On Arithmetic Progressions Of Cycle Lengths In Graphs
A recently posed question of H
Jacques Verstraëte
DM
2000
65views more  DM 2000»
13 years 9 months ago
Long cycles in 3-cyclable graphs
Douglas Bauer, Linda E. McGuire, Huib Trommel, Hen...