70 search results - page 2 / 14 » Degree sequence and supereulerian graphs |
GC
2002
Springer
13 years 7 months ago
2002
Springer
Let G
CPC
2008
13 years 7 months ago
2008
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
DAM
2008
13 years 7 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...
JGT
2008
13 years 7 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 ...