KLX is the min-max congestion of open back edges over DFS traversals; graphs with KLX at most 2 are fully characterized with linear-time recognition, any graph has tree-width at most KLX+1, and KLX ≤ k is MSO2-expressible hence linear-time decidable for fixed k.
and Andersen, Ebbe S
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Congestion Parameter for Depth-First Graph Traversals
KLX is the min-max congestion of open back edges over DFS traversals; graphs with KLX at most 2 are fully characterized with linear-time recognition, any graph has tree-width at most KLX+1, and KLX ≤ k is MSO2-expressible hence linear-time decidable for fixed k.