Sciweavers

213 search results - page 15 / 43
» Regular subgraphs of random graphs
Sort
View
ACSC
2005
IEEE
14 years 1 months ago
Large k-Separated Matchings of Random Regular Graphs
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
Mihalis Beis, William Duckworth, Michele Zito
CPC
2006
91views more  CPC 2006»
13 years 7 months ago
On the Independent Domination Number of Random Regular Graphs
William Duckworth, Nicholas C. Wormald
CPC
2002
76views more  CPC 2002»
13 years 7 months ago
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number
Colin Cooper, Alan M. Frieze, Bruce A. Reed, Olive...
CPC
1999
76views more  CPC 1999»
13 years 7 months ago
Generating Random Regular Graphs Quickly
Angelika Steger, Nicholas C. Wormald