arXiv (All)
open access
Decorated trees
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and the decorations are required to satisfy certain conditions.
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
- Hypergraphs of Low Degree Without Independent Transversals#1387282
- Combinatorial and graph-theoretic properties of the (1,1)-octagonal tilings#332321
- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems#924484
- Circular Chromatic Numbers, Signability, Relation Algebras, and Network Satisfaction Problems#920253
- Coloring Monomial Cayley Graphs: The One-Parameter Case#1233513
Record · ID 1386162
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