arXiv (All)
open access
Circuit Decomposition for Triangulations of Surfaces
An Euler circuit of a graph is a closed path that visits every edge of the graph exactly once. Euler circuit and circuit decomposition problems can also be formulated for higher dimensional simplicial complexes. An Euler k-circuit in K is a cyclic sequence of vertices v_1...v_n such that every k+1 a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Koide Triangulation, the √(3/2) Scale, the √6 Full-State Norm, and an Inverse-Branch Geometric Construction#687436
- A proof of Cairns' conjecture about geodesic triangulations of the 2-sphere#997592
- Structural Parameterizations of $k$-Planarity#1056339
- Hexagonal Geometric Triangulations#984779
- Structure et fonctionnement des peuplements benthiques du Bassin d'Arcachon#350804
Record · ID 927486
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive