I remember that I once read/heard that graphs may be given a shorthand notation when you
- take the upper diagonal of the adjacence matrix,
- put the resulting lines next to each other and
- convert the resulting binary number into hex,
or at least something like that.
Is there a more compact notation when you deal with bicubic graphs?
since you'll get plenty of
00...00 entries with an approach like the one above. I know about the LCF notation, but I would prefer one that also works for non hamiltonian graphs.