arXiv (OAI Expanded)
open access
Orientations without transitive arcs for cubic graphs and phylogenetic networks
An $st$-orientation of an undirected graph $G$ is an acyclic digraph with a single source $s$ and a single sink $t$ that can be obtained from $G$ by assigning a direction to each edge. The classical problem of deciding if an undirected graph $G$ has an $st$-orientation can be solved efficiently. On
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
- Orientations without transitive arcs for cubic graphs and phylogenetic networks#792904
- Infinitely many graph manifolds with unique geometrical piece that admit arbitrarily many Anosov flows#781003
- Infinitely many graph manifolds with unique geometrical piece that admit arbitrarily many Anosov flows#779628
- Bayesian Matrix-Valued Graphs for Context-Dependent Multivariate Relationships#985448
- Reconfiguration of Connected Graph Partitions#665411
Record · ID 788900
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