Small feedback vertex sets in planar digraphs

zbMath1361.05058arXiv1606.04419MaRDI QIDQ528978

Laetitia Lemoine, Frédéric Maffray, Louis Esperet

Publication date: 18 May 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.04419

zbMATH Keywords

planar digraphsfeedback vertex setsdigirth

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Planar Digraphs of Digirth Four are 2-Colorable ⋮ Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth

Cites Work

• Acyclic subgraphs of planar digraphs
• Planar Digraphs of Digirth Five Are 2-Colorable
• A Minimax Theorem for Directed Graphs
• Planar Digraphs without Large Acyclic Sets
• Planar Digraphs of Digirth Four are 2-Colorable

This page was built for publication: Small feedback vertex sets in planar digraphs