On simple characterizations of -trees¶
ROSE, D. (1974). On simple characterizations of -trees. Discrete Mathematics.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Partial k-tree
- The equivalent completion signature begins with a k-tree: under a common convention, start from a clique of size k + 1 and repeatedly add a vertex adjacent to all vertices of an existing k-clique
This sourceRose's paper is the definitional origin of k-trees; its text was not reachable for this check, so the starting-clique convention attributed here rests on the sentence's own hedge rather than on verified wording.
- The equivalent completion signature begins with a k-tree: under a common convention, start from a clique of size k + 1 and repeatedly add a vertex adjacent to all vertices of an existing k-clique
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
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:4dbe2f3bc3c9 · see in the full table