Planar Digraphs without Large Acyclic Sets

DOI10.1002/jgt.22061zbMath1365.05111arXiv1504.06726OpenAlexW2962948471MaRDI QIDQ5272647

Paul S. Wenger, Petru Valicov, Kolja Knauer

Publication date: 30 June 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

planar digraphsfeedback vertex setacyclic set

Mathematics Subject Classification ID

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

Related Items (3)

Small feedback vertex sets in planar digraphs ⋮ The star dichromatic number ⋮ Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth

Uses Software

• SageMath

Cites Work

• Acyclic subgraphs of planar digraphs
• Planar Digraphs of Digirth Five Are 2-Colorable
• On Hamiltonian Circuits

This page was built for publication: Planar Digraphs without Large Acyclic Sets