Combinatorics / CONCEPT
A Good Triple from a Two-Vertex Cut
In a finite cubic graph whose every vertex deletion is connected, a separating pair with nonempty complement yields two nonadjacent neighbors whose deletion remains connected.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
The Endblock Case
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 nearly empty Cartesian layerstructural-affinity · Closed
- Clique color extensionsstructural-affinity · Closed
- Coloring extensions and degree reductionstructural-affinity · Closed
- Coloring Hereditarily Sparse Graphsstructural-affinity · Closed
- Components and Vertex Cutsstructural-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
- Subcubic Brooks Theoremstructural-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