721 search results - page 12 / 145 » Almost universal graphs |
EJC
2006
15 years 21 days ago
2006
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
101
click to vote
EJC
2010
15 years 23 days ago
2010
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
112
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...