641 search results - page 31 / 129 » On Planar Quasi-Parity Graphs |
116
click to vote
ARSCOM
2006
15 years 2 months ago
2006
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
107
click to vote
JCT
2008
15 years 1 months ago
2008
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
132
click to vote
WADS
2001
Springer
15 years 6 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
RSA
2010
15 years 10 days ago
2010
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
119
click to vote
SIBGRAPI
2005
IEEE
15 years 7 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...