Graph Minors. XX. Wagner's Conjecture¶
Robertson, N., & Seymour, P. D. (2004). Graph Minors. XX. Wagner's Conjecture. Journal of Combinatorial Theory, Series B, 92(2), 325-357.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
Domain-specific¶
- Partial k-tree
- Consequently, for each fixed k, the class is minor-closed and has a finite forbidden-minor characterization, although the obstruction set becomes complicated as k increases
This sourceRobertson and Seymour's proof of Wagner's conjecture is what makes the forbidden-minor set finite; the minor-closure of the class and the growth in complexity of the obstruction sets are separate points not established here.
Supported in partVerified against the source
- Consequently, for each fixed k, the class is minor-closed and has a finite forbidden-minor characterization, although the obstruction set becomes complicated as k increases
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? Read against the text for 1 of 2 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
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:60b161ff3eed · see in the full table