arXiv (All)
open access
A short note on $K_{n}$-irregular graphs
This note addresses Theorem 12 in the seminal paper ``$F$-degrees in graphs'' by G. Chartrand et al. (1987), which asserts the existence of $K_n$-irregular graphs for each $n \ge 3$. Although this result is widely cited in the literature as an established fact, the original text lacks a complete pro
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
- Hamiltonicity of mildly pseudorandom regular graphs#1130411
- Triangle-Saturated Graphs in the Semi-Random Graph Process#609120
- Making spanning graphs#1122858
- Paired Domination in Cubic Bipartite Graphs#1078223
- Periodic Joint Co-tiles of Independent Tiles#1154722
Record · ID 1104554
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