Deciding the Erdős-Pósa Property in 3-Connected Digraphs

DOI10.1007/978-3-031-43380-1_5MaRDI QIDQ6496542

Nicolas Nisse, Unnamed Author, Ana Karolinna Maia, Julien Bensmail, Victor A. Campos

Publication date: 3 May 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Representing a planar graph by vertical lines joining different levels
• Graph minors. V. Excluding a planar graph
• A unified approach to visibility representations of planar graphs
• Graph minors. VII: Disjoint paths on a surface
• Packing directed circuits
• Directed tree-width
• 2-Isomorphic Graphs
• On Independent Circuits Contained in a Graph

This page was built for publication: Deciding the Erdős-Pósa Property in 3-Connected Digraphs