arXiv (All)
open access
Order 14 is the largest order for which every 4-total coloring of every cubic graph is equitable
A total coloring of a graph is an assignment of colors to its vertices and edges so that adjacent or incident elements receive distinct colors, and it is equitable when the cardinalities of any two color classes differ by at most one. Stemock conjectured that every $4$-total coloring of a cubic grap
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
- Large components in r ‐edge‐colorings of K n have diameter at most five#14347
- On the extrema of the mean subtree order of graphs#1013436
- Finding Kissing Numbers with Game-theoretic Reinforcement Learning#1061646
- Reconceptualizing Clinical Priority as Relational Influence: Derivation of Drawing Reasoning From a Sequential Programme of Research.#823452
- Domination in Graph Theory: A Bibliometric Analysis of Research Trends, Collaboration, and Citation Networks#714914
Record · ID 972196
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