Combinatorics / CONCEPT
Trapezohedral minimal domination
Closed-private witnesses and the exact labelled one-apex family in a trapezohedral graph.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
Closed-private characterization
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 maximal independent subsets of finite pathsstructural-affinity · Closed
- Classification by an apex and an opposite labelstructural-affinity · Closed
- Critical Vertices and Private Neighboursstructural-affinity · Closed
- Deleting a stem and its leavesstructural-affinity · Closed
- Finite dominating-set averagesstructural-affinity · Closed
- From actual graph subsets to actual path subsetsstructural-affinity · Closed
- Neighbour Replacement for Self-Critical Verticesstructural-affinity · Closed
- One-leaf replication of partial dominating familiesstructural-affinity · Closed
- Path endpoints and the original restricted familystructural-affinity · Closed
- Real-root configurations of book domination polynomialsstructural-affinity · Closed
- Reversible classification of all labelled subsetsstructural-affinity · Closed
- Stem-block counting for dominating setsstructural-affinity · Closed
- The complete formal generating seriesstructural-affinity · Closed
- The order-33 integer domination-root minimality claimstructural-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