Bibliography

  • [MP]
    Preprint

    (untitled)

    B. D. McKay, A. Piperno

    http://pallini.di.uniroma1.it/nug26.pdf

  • [MPW]
    Preprint

    A Dynamic Programming Approach for Timing and Designing Clique Algorithms

    W. Myrvold, T. Prsa, N. Walker

  • [BK73]
    Article

    Finding All Cliques of an Undirected Graph

    C. Bron, J. Kerbosch

    Communications of the ACM 9Vol. 16(9)pp. 575–5771973
  • [HT73]
    Article

    Dividing a Graph into Triconnected Components

    J.E. Hopcroft, R.E. Tarjan

    SIAM J. Comput.Vol. 2(3)pp. 135–1581973
  • [Chr75]
    Book

    Graph Theory, An Algorithm Approach

    N. Christofides

    Academic Press1975
  • [Bre79]
    Article

    New Methods to Color the Vertices of a Graph

    D. Brelaz

    Communications of the ACMVol. 22(9)pp. 251–2561979
  • [Eve79]
    Book

    Graph Algorithms

    Shimon Even

    Computer Science Press1979
  • [McK81]
    Article

    Practical Graph Isomorphism

    B. D. McKay

    Congressus NumerantiumVol. 30pp. 45–871981
  • [Lor89]
    Article

    The construction of Tutte's $8$-cage and the Conder graph

    P. Lorimer

    J. of Graph TheoryVol. 13(5)pp. 553–5571989
  • [TCR90]
    Book

    Introduction to Algorithms

    C. L. T.H. Cormen, R.L. Rivest

    MIT Press1990
  • [AMO93]
    Book

    Network Flows, Theory, Algorithms, and Applications

    R.K. Ahuja, T.L. Magnanti, J.B. Orlin

    Prentice Hall1993
  • [McK98]
    Article

    Isomorph-free exhaustive generation

    B. D. McKay

    J. AlgorithmsVol. 26pp. 306–3241998
  • [BM01]
    Preprint

    Simplified O($n$) Planarity Algorithms

    J. Boyer, W. Myrvold

    J. Algorithms2001

    submitted

  • [GM01]
    Book Chapter

    A Linear Time Implementation of SPQR-Trees

    C. Gutwenger, P. Mutzel

    In Graph Drawing 2000Vol. 1984pp. 70–902001