  
  
                              [1X GraphBacktracking [101X
  
  
            [1X A simple but slow implementation of graph backtracking [101X
  
  
                                     1.1.0
  
  
                                  2 June 2026
  
  
                             Christopher Jefferson
  
                                 Wilf A. Wilson
  
  
  
  Christopher Jefferson
      Email:    [7Xmailto:caj21@st-andrews.ac.uk[107X
      Homepage: [7Xhttp://caj.host.cs.st-andrews.ac.uk/[107X
      Address:  [33X[0;14YSt Andrews[133X
                [33X[0;14YScotland[133X
                [33X[0;14YUK[133X
  
  
  Wilf A. Wilson
      Email:    [7Xmailto:gap@wilf-wilson.net[107X
      Homepage: [7Xhttps://wilf.me[107X
  
  -------------------------------------------------------
  
  
  [1XContents (GraphBacktracking)[101X
  
  1 [33X[0;0YIntroduction[133X
    1.1 [33X[0;0YWhat is [5XGraphBacktracking[105X?[133X
    1.2 [33X[0;0YRelationship to BacktrackKit and Vole[133X
  2 [33X[0;0YExecuting a search[133X
    2.1 [33X[0;0YInformation and diagnostics[133X
    2.2 [33X[0;0YThe main search interface[133X
      2.2-1 GB_SimpleSearch
      2.2-2 GB_SimpleSinglePermSearch
      2.2-3 GB_SimpleAllPermSearch
    2.3 [33X[0;0YInspecting the initial graph stack[133X
      2.3-1 GB_CheckInitialGroup
      2.3-2 GB_CheckInitialCoset
  3 [33X[0;0YRefiners[133X
    3.1 [33X[0;0YThe [10XGB Con[110X record[133X
    3.2 [33X[0;0YGroup and coset refiners[133X
    3.3 [33X[0;0YTransporter refiners[133X
    3.4 [33X[0;0YNormaliser and group-conjugacy refiners[133X
    3.5 [33X[0;0YExperimental normaliser variants[133X
  4 [33X[0;0YEquitable Graphs[133X
    4.1 [33X[0;0YMaking a partition equitable[133X
      4.1-1 GB_MakeEquitableNone
      4.1-2 GB_MakeEquitableWeak
      4.1-3 GB_MakeEquitableStrong
      4.1-4 GB_MakeEquitableFull
  
  
  [32X
