46 search results - page 1 / 10 » Separability Generalizes Dirac's Theorem |
DAM
1998
13 years 4 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
DM
2008
13 years 4 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
PLDI
2011
ACM
12 years 7 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
COMBINATORICA
2008
13 years 4 months ago
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...