Combinatorics / CONCEPT
Two Ordered Cuts of an Actual Graph Path
Two ordered actual path edges determine three endpoint-typed paths with full support and exact retained edges.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
Cut at the Two Supplied Edge Positions
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 Path Families Retain the Same Cycle Inventorystructural-affinity · Closed
- Actual Route Inventoriesstructural-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
- Ordered Cuts in an Actual Joined Routestructural-affinity · Closed
- Recovering Actual Path Prefixes from Retained Inventoriesstructural-affinity · Closed
- Reordering and Joining Actual Cycle Piecesstructural-affinity · Closed
- Splicing Actual Paths around a Ringstructural-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