721 search results - page 38 / 145 » Almost universal graphs |
95
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
JCT
2011
14 years 7 months ago
2011
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
85
Voted
SIGCPR
1999
ACM
15 years 5 months ago
1999
ACM
This paper addresses the diffusion of Knowledge Management concepts, principles, and cases into university courses. Although we are now living in a world of gigabit transmission s...
130
click to vote
WADS
2007
Springer
15 years 7 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
CORR
2008
Springer
15 years 27 days ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...