Combinatorics / CONCEPT
A Path Hull Without Cut Vertices
Vertex inseparability produces a connected subgraph without cut vertices.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
A common cover for an unseparated set
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
- Bridge Contraction in Bipartite Graphsstructural-affinity · Closed
- Connected Subgraph Counts at a Bridgestructural-affinity · Closed
- De–Patra Conjecture 2.9structural-affinity · Closed
- Minimal bipartite Erdős–Gyárfás counterexamples have no bridgestructural-affinity · Closed
- Native Bridge and Pendant Countingstructural-affinity · Closed
- The Subgraph Core and Native Blocksstructural-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