Skip to main content

and
Your search also matched 13 preview-only Content is preview-only when you or your institution have not yet subscribed to it.

By making our abstracts and previews universally accessible we help you purchase only the content that is relevant to you.
results, e.g.

Paths to Trees and Cacti

Include preview-only content
  1. Chapter and Conference Paper

    On the Complexity of Singly Connected Vertex Deletion

    A digraph D is singly connected if for all ordered pairs of vertices \(u,v\in V(D)\) , there is at most one path in D

    Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil in Combinatorial Algorithms (2020)