Koc University Digital Collections
metadata only
Decomposing complete multipartite graphs into closed trails of arbitrary even lengths
We prove that any complete multipartite graph with parts of even size can be decomposed into closed trails with prescribed even lengths.
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
- A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth#1077223
- Destroying symmetry by orienting edges: Complete graphs and complete bigraphs#490166
- A Counterexample to Wormald's Conjecture#1154709
- A Sublinear Minimum-Degree Condition for $2$-Connected Subgraphs of All Orders#793866
- A Sublinear Minimum-Degree Condition for $2$-Connected Subgraphs of All Orders#789847
Record · ID 955096
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