pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DM 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

A Congestion Parameter for Depth-First Graph Traversals

cs.DM · 2026-06-23 · conditional · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • A Congestion Parameter for Depth-First Graph Traversals cs.DM · 2026-06-23 · conditional · none · ref 13

    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.