Combinatorics / CONCEPT
Components and Vertex Cuts
A finite connected graph separated by one vertex splits into two connected pieces sharing that vertex.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH1
DOCUMENT LINKS1
Two Connected Sides of a Cut Vertex
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
- A Good Triple from a Two-Vertex Cutstructural-affinity · Closed
- A nearly empty Cartesian layerstructural-affinity · Closed
- A product decomposition of the generalized CHSH groupsstructural-affinity · Closed
- Characterizing well-covered Cayley squaresstructural-affinity · Closed
- Clique and odd-cycle surgerystructural-affinity · Closed
- Clique color extensionsstructural-affinity · Closed
- Coloring extensions and degree reductionstructural-affinity · Closed
- Coloring Hereditarily Sparse Graphsstructural-affinity · Closed
- Connected encoder classes and powers of threestructural-affinity · Closed
- Deterministic Rainbow Two-Edge Choicesstructural-affinity · Closed
- Greedy Coloring and Vertex Extensionsstructural-affinity · Closed
- Rainbow Rank Descent with a Reserved Final Edgestructural-affinity · Closed
- Reconstruction from even-legged hyperlinksstructural-affinity · Closed
- Subcubic Brooks Theoremstructural-affinity · Closed
- The forbidden-subgraph conjecture for MMI in graph statesstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance