36 search results - page 1 / 8 » An Extremal Problem on Degree Sequences of Graphs |
GC
2002
Springer
13 years 7 months ago
2002
Springer
Let G
COMBINATORICA
2006
13 years 7 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
DM
2008
13 years 7 months ago
2008
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
MFCS
1995
Springer
13 years 11 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. This paper addresses the problem of articulated motion tracking from image sequences. We describe a method that relies on an explicit parameterization of the extremal con...