arXiv (All)
open access
The Pairing-Hamiltonian property in Cartesian products of graphs
Let $G$ be a simple graph of even order at least four, and let $K_G$ denote the complete graph on $V(G)$. A perfect matching of $K_G$ is called a pairing of $G$. The graph $G$ has the Pairing-Hamiltonian property, or PH-property, if every pairing $M$ of $G$ admits a perfect matching $N\subseteq E(G)
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
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- M-Fibration Theory with Applications to Weighted Graphs#1122482
- Combinatorics of descent algebras and graph coverings#971114
- DP vertex-arboricity of sparse graphs#1117503
- Lorentzian polynomials and log-concavity of the independence polynomials of graphs#1141872
Record · ID 1036073
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