Well-Covered Graphs¶
Hartnell, B. L. (1999). Well-Covered Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 107-115.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Well-covered graph
- A well-covered graph is a finite simple undirected graph in which every inclusion-maximal independent vertex set has the same cardinality.
This sourceComplete maximal-set enumerations above are independently checked finite derivations, not claims about printed lists. Its searchable P3 sentence was truncated, so the P3 counterexample above rests on direct finite proof.
- A well-covered graph is a finite simple undirected graph in which every inclusion-maximal independent vertex set has the same cardinality.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:d261d11829be · see in the full table