Searching for acyclic orientations of graphs

DOI10.1016/0012-365X(94)00281-MzbMath0831.05033MaRDI QIDQ1898338

Eberhard Triesch, Zsolt Tuza, Martin Aigner

Publication date: 12 February 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityorientationproblemsacyclicindependent verticesexhaustive graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Counting restricted orientations of random graphs ⋮ Finding an Unknown Acyclic Orientation of a Given Graph ⋮ The acyclic orientation game on random graphs ⋮ The oriented cycle game

Cites Work

• Parallel concepts in graph theory
• Acyclic orientations of graphs
• Hard Enumeration Problems in Geometry and Combinatorics
• On a Probabilistic Graph-Theoretical Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Searching for acyclic orientations of graphs