Zenodo (CERN)
open access
CC BY 4.0
Cyclically 4-Edge-Connected Cubic Graphs of Unbounded Petersen Defect
The Petersen defect of a cubic graph is the least number of vertices at which an edge map into the Petersen graph fails to send the vertex star onto a vertex star; it is zero exactly for the graphs with a Petersen coloring, and it bounds from below the least number of abnormal edges of a proper 5
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Towards Solving the Gilbert-Pollak Conjecture via Large Language Models#924496
- Towards Solving the Gilbert-Pollak Conjecture via Large Language Models#920265
- A Four-Connected Graph without a Legal System#1071209
- Extending Courcelle's Theorem with Optimality Predicates#1110318
- Minimum euclidien des ordres maximaux dans les algèbres centrales à division#401946
Record · ID 1092941
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive