Sciweavers

31 search results - page 3 / 7
» Regular induced subgraphs of a random Graph
Sort
View
EJC
2006
13 years 10 months ago
3-star factors in random d-regular graphs
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...
Hilda Assiyatun, Nicholas C. Wormald
RSA
2006
66views more  RSA 2006»
13 years 10 months ago
Regular graphs whose subgraphs tend to be acyclic
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
Noga Alon, Eitan Bachmat
RSA
2008
70views more  RSA 2008»
13 years 9 months ago
Distribution of subgraphs of random regular graphs
Zhicheng Gao, Nicholas C. Wormald
CIAC
2010
Springer
281views Algorithms» more  CIAC 2010»
13 years 7 months ago
Parameterized Complexity of Even/Odd Subgraph Problems
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
Leizhen Cai, Boting Yang
ENDM
2000
121views more  ENDM 2000»
13 years 10 months ago
Finding the chromatic number by means of critical graphs
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
Francine Herrmann, Alain Hertz