arXiv (OAI Expanded)
open access
Countable Graphs with Finite Path-width: Characterisation and Universality
We study path-width and the closely related parameter line-width in countably infinite graphs. Our first result characterises the graphs of finite path-width: they are the graphs that do not have infinitely many vertices of infinite degree, do not have infinitely many pairwise disjoint infinite path
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
- Countable Graphs with Finite Path-width: Characterisation and Universality#781047
- Premaniplexes of rank $3$ and $4$ as symmetry type graphs of maniplexes#1070589
- Schur States and Many-Body Quantum Walks on Line Graphs#793657
- Schur States and Many-Body Quantum Walks on Line Graphs#789653
- Hierarchical geometry and right-angled Artin groups in graph braid groups#974698
Record · ID 779672
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