On Cover Graphs and Dependent Arcs in Acyclic Orientations

DOI10.1017/S0963548305006760zbMath1075.05080OpenAlexW2122123300MaRDI QIDQ5696365

Lubos Thoma, Vojtěch Rödl

Publication date: 18 October 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305006760

zbMATH Keywords

random graphsparse regularity lemma

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorics of partially ordered sets (06A07)

Related Items (5)

On fully orientability of 2-degenerate graphs ⋮ On preserving full orientability of graphs ⋮ Full orientability of graphs with at most one dependent arc ⋮ Independent arcs of acyclic orientations of complete \(r\)-partite graphs ⋮ Full Orientability of Graphs

This page was built for publication: On Cover Graphs and Dependent Arcs in Acyclic Orientations