Landscapes on spaces of trees | 3 | 0.56 | 2002 |
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes | 5 | 0.62 | 2001 |
Forestal Algebras And Algebraic Forests (On A New Class Of Weakly Compact Graphs) | 6 | 0.58 | 2000 |
Recognizing circulant graphs of prime order in polynomial time | 16 | 1.50 | 1998 |
Hamiltonicity in Graphs with Few P4's | 9 | 0.71 | 1995 |
Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings | 30 | 7.34 | 1995 |
Direct Path Graph Isomorphism (Extended Abstract) | 0 | 0.34 | 1994 |
Hard-to-color graphs for connected sequential colorings | 3 | 0.70 | 1994 |
A branch and bound algorithm for the maximum clique problem | 19 | 2.44 | 1990 |
Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings | 20 | 4.92 | 1987 |
A Travelling Salesman Problem with Additional Constraints. | 0 | 0.34 | 1981 |
On the Use of Some Almost Sure Graph Properties | 0 | 0.34 | 1980 |
Zur Bestimmung der Automorphismen eines endlichen Graphen | 1 | 0.42 | 1975 |