Louisiana Tech Digital Commons
metadata only
Obstruction sets for classes of cubic graphs
This dissertation establishes two theorems which characterize the set of minimal obstructions for two classes of graphs. A minimal obstruction for a class of graphs is a graph that is not in the class but every graph that it properly contains, under some containment relation, is in the class. In Cha
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
- Unavoidable induced subgraphs forced by graphs with many vertices of prescribed properties#1122975
- Classifying Prime Character Degree Graphs With Eight Vertices#1048599
- Nearly Spanning Regular Subgraphs#1014363
- Roads to Necessitarianism#750886
- Linearity of fundamental groups of graphs of virtually cyclic groups#665513
Record · ID 958160
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