arXiv (All)
open access
Hamilton paths and cycles in flip graphs of (almost-)perfect matchings
We consider the set of matchings of a graph and a local change operation, called a flip, between them. In the combinatorial setting, the base graphs are either complete graphs or complete bipartite graphs, and in the geometric setting, the graphs are embedded on point sets in the plane, with the req
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
- The biwheel conjecture for braces#1297307
- Exact and extremal values of chromatic villainy#1297932
- A Matroid Generalization of Weighted Popular Matching: Characterization and Algorithm#1342953
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- Prime factorisation of stable-matching instances: uniqueness, simultaneous products, and an exact census#1201630
Record · ID 1297192
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