arXiv (All)
open access
Acyclic orientations of mixed graphs
A mixed graph $M=(V,E\cup A)$ is acyclic if its directed part $(V,A)$ is an acyclic digraph. In this note we study the so-called orientation completion problem for the class of acyclic mixed graphs. That is, given an acyclic mixed graph $M$ and a property ${\cal P}$; can we orient the edges of $M$ s
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
- Ramsey properties of maximal (outer)planar graphs#972204
- A Polynomially Searchable Exponential Neighbourhood for Graph Colouring#824269
- Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming#819229
- Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming#809237
- Spectral Extremal Graphs without a $K_k$-Factor#1035928
Record · ID 1116734
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