English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Every connected simple graph G has an acyclic orientation. Deflne a graph AO(G) whose vertices are the acyclic orientations of G and whose edges join orientations that difier by reversing the direction of a single edge. It was known previously that AO(G) is connected but not necessarily Hamiltonian. However, Squire [3] proved that the square AO(G) 2 is Hamiltonian. We prove the slightly stronger result that the prism AO(G)£e is Hamiltonian. If G is a mixed graph (some edges directed, but not necessarily all), then AO(G) can be deflned as before. The graph AO(G) is again connected but we give examples showing that the prism is not necessarily Hamiltonian.

The Prism of the Acyclic Orientation Graph is Hamiltonian