: 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 ...
Michael D. Barrus, Mohit Kumbhat, Stephen G. Hartk...
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...
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...
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 ...