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

DOI

10.1006/jctb.1993.1027

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:a81c2ce6c23c · see in the full table