Datenvertragswerk
finite graph graphic matroid regular coverings
Classify ALL connected regular k-sheeted coverings of the original finite connected simple undirected labeled base graph, up to covering isomorphism OVER THE IDENTITY of that fixed base. n1..4,sorted unique edges u<v, k1..3. This is topological graph covering, not edge cover/vertex cover, graph automorphism of one supplied lift, or enumeration of matroid bases. Fix the lex greedy spanning tree in input sorted edge order, orient every edge low-to-high, normalize tree voltage to identity and.
POST https://datenvertrag.halowerk.com/v1/finite-graph-graphic-matroid-regular-coveringsInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | integer | Yes | |
| edges | array | Yes | |
| sheets | integer | Yes | |
| claim_cover_classes | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"edges",
"sheets",
"claim_cover_classes"
],
"properties": {
"n": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"edges": {
"type": "array",
"minItems": 0,
"maxItems": 6,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
}
},
"sheets": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"claim_cover_classes": {
"anyOf": [
{
"type": "array",
"minItems": 0,
"maxItems": 13,
"items": {
"type": "array",
"minItems": 0,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"n": 2,
"edges": [
[
0,
1
]
],
"sheets": 2,
"claim_cover_classes": []
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.