arXiv (All)
open access
Encoding and Enumerating Acyclic Orientations of Graphs
In this work we study the acyclic orientations of graphs. We obtain an encoding of the acyclic orientations of the complete $p$-partite graph with size of its parts $n_1,n_2,\ldots,n_p$ via a vector with $p$ symbols and length $n=n_1+n_2+\ldots+n_p$ when the parts are fixed but not the vertices in e
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
- Acyclic orientations of mixed graphs#1116734
- The Erdős-Pósa Property for Colorful Minors#971921
- Non-isomorphic graphs have distinct vertex-Ramsey classes#1188415
- Ramsey properties of maximal (outer)planar graphs#972204
- Cyclic Incidence Orderings of Complete Graphs and 3-Uniform Hypergraphs#974819
Record · ID 1200707
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