arXiv (All)
open access
On graphs whose powers are well-covered
In this paper, we investigate graphs with the property that all of their powers are well-covered. We obtain complete classifications for several graph classes, including chordal graphs, cochordal graphs, and very well-covered graphs.
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
- Ramsey properties of maximal (outer)planar graphs#972204
- Unavoidable induced subgraphs forced by graphs with many vertices of prescribed properties#1122975
- On minimal regular graphs with given constraintsm#1041667
- Every graph with no $K_7^=$ minor is 6-colorable#1011483
- Counterexamples to the Strong Roberson Conjecture#1188228
Record · ID 1233339
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