5473 search results - page 39 / 1095 » On the graph isomorphism problem |
DM
2006
14 years 12 months ago
2006
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...
COMBINATORICS
2006
14 years 12 months ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
JCT
2008
14 years 11 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
SODA
1996
ACM
15 years 1 months ago
1996
ACM
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
111
click to vote
DM
1998
14 years 11 months ago
1998
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...