arXiv (All)
open access
Note on the thickness of the Cartesian product of a complete graph and a path
We determine the thickness of the Cartesian product $K_{6p+4} \, \square \, P_2$ for $p \ge 0$ and of the Cartesian product $K_8 \, \square \, P_m$ for $m \ge 1$, where $K_n$ and $P_m$ denote the complete graph on $n$ vertices and the path on $m$ vertices, respectively. These are two of the three re
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
- Algorithmic Design and Fabrication of Soft Curved-Folding#355784
- Spectral bipartiteness in generalized odd graphs of diameter three#999419
- The Upper Clique Transversal Problem: Hardness and Algorithms#1297967
- Jacobi Endpoint Pencils and Sharp Interlacing for Centered Binomial Samples#1356149
- Improved lower bounds on the maximum size of graphs with girth 5#1061619
Record · ID 1342435
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