Lund University Publications
metadata only
Register allocation by optimal graph coloring
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
- Efficient allocation with ordinal preference intensities#144160
- On Edge Coloring of Multigraphs#1082904
- Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs#344749
- Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs#344748
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
Record · ID 395714
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