Combinatorics / CONCEPT
Deleting a stem and its leaves
The residual graph has no isolated vertices when the original graph has none.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH2
DOCUMENT LINKS0
A retained neighbour
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
- Classification by an apex and an opposite labelstructural-affinity · Closed
- Critical Vertices and Private Neighboursstructural-affinity · Closed
- Dominating sets omitting a stemstructural-affinity · Closed
- Finite dominating-set averagesstructural-affinity · Closed
- Neighbour Replacement for Self-Critical Verticesstructural-affinity · Closed
- One-leaf replication of partial dominating familiesstructural-affinity · Closed
- Real-root configurations of book domination polynomialsstructural-affinity · Closed
- Replicated dominating-set averagesstructural-affinity · Closed
- Stem-block counting for dominating setsstructural-affinity · Closed
- The complete formal generating seriesstructural-affinity · Closed
- The one-copy hub isomorphismstructural-affinity · Closed
- The stem-conditioned splitstructural-affinity · Closed
- Transporting residual dominationstructural-affinity · Closed
- Trapezohedral minimal dominationstructural-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