relabelBipartite -- relabels a bipartite graph so all vertices of a given class are contiguous

Synopsis

• Usage:

  L' = relabelBipartite L

  T = relabelBipartite S

  H = relabelBipartite G

• Inputs:
  • L, a list, a list of bipartite graphs in various formats
  • S, a string, a bipartite graph encoded in either Sparse6 or Graph6 format
  • G, an instance of the type Graph, a bipartite graph
• Outputs:
  • L', a list, a list of graphs isomorphic to $S$
  • T, a string, a graph isomorphic to $S$ encoded in either Sparse6 or Graph6 format
  • H, an instance of the type Graph, a graph isomorphic to $G$

Description

i1 : G = graph {{1,2},{1,4},{1,6},{3,2},{3,4},{3,6},{5,2},{5,4},{5,6}};

i2 : relabelBipartite G

o2 = Graph{0 => {3, 4, 5}}
           1 => {3, 4, 5}
           2 => {3, 4, 5}
           3 => {0, 1, 2}
           4 => {0, 1, 2}
           5 => {0, 1, 2}

o2 : Graph

See also

• relabelGraph -- applies a vertex invariant based refinement to a graph