Combinatorics / CONCEPT
Actual Route Inventories
Map the same cycle, pieces and cuts through an injective graph homomorphism.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH1
DOCUMENT LINKS0
Transport an Actual Cycle Partition
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Actual Endpoints of Hamilton Cycle Slicesstructural-affinity · Closed
- Actual Native Half Partitionsstructural-affinity · Closed
- Actual Path Families Retain the Same Cycle Inventorystructural-affinity · Closed
- Actual Route Inventoriesstructural-affinity · Closed
- Cutting Actual Graph Walks into Pathsstructural-affinity · Closed
- Cutting the Forced Prefix of an Actual Graph Pathstructural-affinity · Closed
- Endpoint Pairs after Actual Joint Replacementstructural-affinity · Closed
- Map One Cycle and Both Marked Orders Togetherstructural-affinity · Closed
- Same-Cycle Native Joint Componentsstructural-affinity · Closed
- Two Ordered Cuts of an Actual Graph Pathstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance