arXiv (All)
open access
A Dichotomy for Planar Graph Homomorphisms with Nonnegative Weights
We prove a complete complexity dichotomy for planar graph homomorphism counting with any fixed symmetric nonnegative matrix of arbitrary finite order, giving an explicit criterion for tractability. We also characterize exactly which fixed positive vertex weights preserve tractability, with both clas
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
- Entrywise Logarithmic Matrix Algebra and Dichotomy of Planar Graph Homomorphisms (Part I)#1155763
- Degree Adjacency Diametrical Matrix of Graphs Spectral Properties and Energy Bounds#1297466
- Spectral Methods for the Complexity of Planar Graph Homomorphisms#1130914
- Degree-based weighted adjacency matrices: spectra, integrality, and edge deletion effects#998133
- Strengthened upper bound on the third eigenvalue of graphs#1141400
Record · ID 1201425
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