215 search results - page 5 / 43 » On extremal k-outconnected graphs |
DM
2008
13 years 7 months ago
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- Curves and natural frames can be used for describing and controlling motion in both biological and engineering contexts (e.g., pursuit and formation control). The geomet...
ARSCOM
2005
13 years 7 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
ICMS
2010
13 years 5 months ago
2010
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
DM
2008
13 years 7 months ago
2008
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451