pith. sign in

Theoretical computer science , volume=

A partial k-arboretum of graphs with bounded treewidth , author= · 1998

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
browse 2 citing papers

fields

math.CO 1 math.GR 1

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

Almost planar finitely presented groups

math.GR · 2026-05-04 · unverdicted · novelty 7.0

Finitely presented groups with k-planar Cayley graphs have finite-index subgroups with planar Cayley graphs; k-planar coarsely simply connected quasi-transitive graphs are quasi-isometric to planar graphs.

Lions and Contamination: Trees and General Graphs

math.CO · 2026-04-21 · unverdicted · novelty 6.0

For trees the lion number satisfies pw(T) ≤ L(T) ≤ pw(T)+1; for connected graphs L(G) ≤ pw(G)+1 and the monotone lion number obeys pw(G) ≤ L^m(G) ≤ 2pw(G)+2, with monotonicity holding for isometric subgraphs but not arbitrary ones.

citing papers explorer

Showing 2 of 2 citing papers.

  • Almost planar finitely presented groups math.GR · 2026-05-04 · unverdicted · none · ref 14

    Finitely presented groups with k-planar Cayley graphs have finite-index subgroups with planar Cayley graphs; k-planar coarsely simply connected quasi-transitive graphs are quasi-isometric to planar graphs.

  • Lions and Contamination: Trees and General Graphs math.CO · 2026-04-21 · unverdicted · none · ref 12

    For trees the lion number satisfies pw(T) ≤ L(T) ≤ pw(T)+1; for connected graphs L(G) ≤ pw(G)+1 and the monotone lion number obeys pw(G) ≤ L^m(G) ≤ 2pw(G)+2, with monotonicity holding for isometric subgraphs but not arbitrary ones.