Acyclic subgraphs of planar digraphs

zbMath1325.05060arXiv1407.8045MaRDI QIDQ2517654

Noah Golowich, David Rolnick

Publication date: 27 August 2015

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

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

zbMATH Keywords

digraphchromatic numberplanar graphacyclic setdirected cut

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Planar Digraphs of Digirth Four are 2-Colorable ⋮ Small feedback vertex sets in planar digraphs ⋮ Acyclic Digraphs ⋮ Planar Digraphs without Large Acyclic Sets

Cites Work

• Two results on the digraph chromatic number
• On acyclic colorings of planar graphs
• Digraph Girth via Chromatic Number
• Planar Digraphs of Digirth Five Are 2-Colorable
• A Separator Theorem for String Graphs and its Applications
• Acyclic systems of representatives and acyclic colorings of digraphs
• A Minimax Theorem for Directed Graphs
• The circular chromatic number of a digraph
• Automata, Languages and Programming

This page was built for publication: Acyclic subgraphs of planar digraphs