27 search results - page 1 / 6 » A Characterization of the Degree Sequences of 2-Trees |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
JGT
2008
13 years 4 months ago
2008
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...
DAM
2008
13 years 4 months ago
2008
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
BIRD
2008
Springer
13 years 6 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
IJBC
2002
13 years 4 months ago
2002
Let F be the lifting of a circle map of degree one. In [?] a notion of F-rotation interval of a point x S1 was given. In this paper we define and study a new notion of a rotation ...