arXiv (All)
open access
On perfect matchings, edge-colourings and eigenvalues of cubic graphs
We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that is, an edge colouring with three colors) the answer is known t
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 Polynomially Searchable Exponential Neighbourhood for Graph Colouring#824269
- A counterexample to the quantum Hedetniemi conjecture#1034490
- A Chvátal-type codegree condition for Hamiltonian cycles in $k$-uniform hypergraphs#985948
- A solution to a conjecture on the signless Laplacian spectral radius for $t$-color-critical graphs#1035773
- Acyclic orientations of mixed graphs#1116734
Record · ID 1155098
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