zbMATH Open
metadata only
On the equality of the Grundy and ochromatic numbers of a 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
- Self-complementary completions on six vertices#1033999
- Defective chromatic polynomials#1118544
- Generalizing Eulerian Numbers via Semipermutations: Topological and Combinatorial Aspects#1117306
- Strong edge coloring of graphs with maximum degree $6$#1119018
- Equal knapsack identities between symmetric group character degrees#1012061
Record · ID 490239
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