pith. sign in

Hlinˇ en´ y:Branch-width, parse trees, and monadic second-order logic for matroids, 20th Annual Symposium on Theoretical Aspects of Com- puter Science (STACS), LNCS vol

· 2003

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

1 Pith paper citing it
browse 1 citing papers

fields

math.CO 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Fundamental cycles in grid graphs

math.CO · 2026-04-19 · unverdicted · novelty 7.0

Any spanning tree of the n x n grid has fundamental cycles with average length Omega(log n), and the bound is tight.

citing papers explorer

Showing 1 of 1 citing paper.

  • Fundamental cycles in grid graphs math.CO · 2026-04-19 · unverdicted · none · ref 28

    Any spanning tree of the n x n grid has fundamental cycles with average length Omega(log n), and the bound is tight.