Graph Searching and a Min-Max Theorem for Tree-Width

Seymour, P. D., & Thomas, R. (1993). Graph Searching and a Min-Max Theorem for Tree-Width. Journal of Combinatorial Theory, Series B, 22-33.

Type

Journal article

Intellectual base

Primary research

Year

1993

Pages

22-33

DOI

10.1006/jctb.1993.1027

DOI registrant

Elsevier

Link

https://doi.org/10.1006/jctb.1993.1027

Cited by

1 citation across 1 artifact.

Domain-specific

• Haven (Graph Theory)
  • In the original touching convention, every two selected flaps touch: they intersect or an edge joins them.

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:a81c2ce6c23c · see in the full table