arXiv (All)
open access
Edge-Coloring Power Graphs
In this paper, we investigate the edge-coloring number of various graphs defined on finite groups. We notably show that the power graph of a finite group $G$ is overfull if and only if the power graph of $G$ is of Class $2$ (has edge-coloring number one more than its maximum vertex degree) if and on
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
- On the finite group whose proper enhanced power graph is claw-free#620826
- On the finite group whose proper enhanced power graph is claw-free#619147
- Finite groups with large power-avoiding subsets#1012694
- Anti-Ramsey Number for Suspension of Edge-Critical Graphs#798170
- Anti-Ramsey Number for Suspension of Edge-Critical Graphs#796757
Record · ID 1130460
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