Koc University Digital Collections
metadata only
Maxiumum packing of inside perfect 8-cycle systems
For an m-cycle C, an inside m-cycle of C is a cycle that is on the same vertex set and edge-disjoint from C. In an m-cycle system, (X, C), if inside m-cycles can be chosen-one for each cycle-to form another m-cycle system, then (chi, C) is called an inside perfect m-cycle system. Inside perfect cycl
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
- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries#1064362
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
- Edge codes constructed from unicyclic graphs#799611
- Long Cycles in 2-Connected Tough Graphs#1000101
- The Homotopy Types of the Independence and Perfect Matching Complexes of Möbius and Circular Ladder Graphs#1109141
Record · ID 955675
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