Dataset
Martin invariants
- Documentation:
- These text files contain Martin invariants for complete lists of cyclically 4-connected 3-regular graphs (Martin3.txt) and cyclically 6-connected 4-regular graphs (Martin4.txt). For each regular graph G, the Martin invariant is the integer that counts the number of partitions of the edges of G into spanning trees. For details, see the paper "Feynman symmetries of the Martin and c_2 invariants of regular graphs" by Erik Panzer and Karen Yeats in Combinatorial Theory.
Actions
Access Document
- Files:
-
-
(Accepted manuscript, plain, 7.1MB, Terms of use)
-
(Accepted manuscript, plain, 1.5MB, Terms of use)
-
Authors/Creators
+ Royal Society
More from this funder
- Funder identifier:
- https://ror.org/03wnrjx87
- Grant:
- URF\R1\201473
- URF\R1\201473
- Publisher:
- University of Oxford
- DOI:
- Language:
-
English
- Keywords:
- Pubs id:
-
2041321
- Local pid:
-
pubs:2041321
- Deposit date:
-
2024-10-21
- ARK identifier:
Terms of use
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record