Koc University Digital Collections
metadata only
Maximum packing for perfect four-triple configurations
The graph consisting of the four 3-cycles (triples) (x(1), x(2), x(8)), (x(2), x(3), x(4)), (x(4), x(5), x(6)), and (x(6), x(7), x(8)), where x(i)'s are distinct, is called a 4-cycle-triple block and the 4-cycle (x(2), x(4), x(6), x(8)) of the 4-cycle-triple block is called the interior (inside) 4-c
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
- Computing the minimal perimeter polygon for digital objects in the triangular tiling#1083616
- On the minimum number of triangles in balanced tripartite graphs with large minimum degree#1034400
- A bat algorithm to solve the manufacturing cell design problem [Resolución del Manufacturing Cell Design Problem utilizando el Algoritmo Bat]#948508
- MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem#1156291
- Matroid Packing Games: The Core and the Nucleolus#1141321
Record · ID 955115
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