arXiv (All)
open access
Wild number for spanning trees in complete and complete bipartite graphs
Given an edge-colored graph, the wild number measures how close the graph is to having a spanning tree in every color. We investigate this parameter for complete graphs and complete bipartite graphs, with particular emphasis on minimum proper colorings and equitable $2$-colorings. For complete graph
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
- The game chromatic number of generalized Mycielski graphs of paths and cycles#924181
- The game chromatic number of generalized Mycielski graphs of paths and cycles#919950
- A disproof of a gap-one conjecture for the equitable chromatic number of block graphs#609675
- Vizing's theorem for signed multigraphs#1117820
- Locally bipartite subgraphs via multicolor Ramsey numbers#984213
Record · ID 1357797
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