Sciweavers

77 search results - page 1 / 16
» Large cycles in 4-connected graphs
Sort
View
63
Voted
DM
2011
180views Education» more  DM 2011»
14 years 5 months ago
Large cycles in 4-connected graphs
M. Zh. Nikoghosyan, Zh. G. Nikoghosyan
71
Voted
DM
2002
104views more  DM 2002»
14 years 10 months ago
4-connected maximal planar graphs are 4-ordered
It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...
Wayne Goddard
80
Voted
SIAMDM
2008
86views more  SIAMDM 2008»
14 years 9 months ago
Hamilton Cycles in Planar Locally Finite Graphs
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
Henning Bruhn, Xingxing Yu
DM
2008
110views more  DM 2008»
14 years 10 months ago
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian), by Thomassen (every 4-connected line graph is hamiltonian) and by Fleischne...
Hajo Broersma, Gasper Fijavz, Tomás Kaiser,...
ICPR
2010
IEEE
14 years 7 months ago
Object Tracking with Ratio Cycles Using Shape and Appearance Cues
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...
Mehmet Emre Sargin, Pratim Ghosh, B. S. Manjunath,...