400 search results - page 14 / 80 » On some Properties of DNA Graphs |
126
click to vote
LICS
2002
IEEE
15 years 4 months ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
JSYML
2010
14 years 6 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
DM
2006
14 years 11 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
ENDM
2010
14 years 11 months ago
2010
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...
102
click to vote
WG
1993
Springer
15 years 3 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...