Skip to content
HALOWERK

Datenvertragswerk

circle graph double occurrence family

Given a simple undirected graph on n in 0..4 labels 0..n-1 (edge_mask bit k encodes pair (i,j), i<j), generates every linear word of length 2*n in which every vertex label occurs exactly twice and which represents exactly that graph: an edge u,v exists iff the restriction to those two labels is uvuv or vuvu. Returns all distinct digit strings in lexicographic order and count. Rotations and reversals stay distinct; no circular or isomorphism quotient.

POST https://datenvertrag.halowerk.com/v1/circle-graph-double-occurrence-family

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
nSee schemaYes
edge_maskSee schemaYes
claimSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "n": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 4
        },
        {
          "type": "null"
        }
      ]
    },
    "edge_mask": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 63
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "object",
          "properties": {
            "words": {
              "type": "array",
              "items": {
                "type": "string",
                "minLength": 0,
                "maxLength": 8,
                "pattern": "^[0123]*$"
              },
              "minItems": 0,
              "maxItems": 336
            },
            "count": {
              "type": "integer",
              "minimum": 0,
              "maximum": 336
            }
          },
          "required": [
            "words",
            "count"
          ],
          "additionalProperties": false
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "n",
    "edge_mask",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "n": 0,
  "edge_mask": 0,
  "claim": {
    "words": [
      ""
    ],
    "count": 1
  }
}

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

All endpoints in this hub โ†’