Pages that link to "Item:Q294704"
From MaRDI portal
The following pages link to Generating all the acyclic orientations of an undirected graph (Q294704):
Displaying 11 items.
- On extensions, linear extensions, upsets and downsets of ordered sets (Q556831) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Algorithms for media (Q947070) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- The size distribution for Markov equivalence classes of acyclic digraph models. (Q1852851) (← links)
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations (Q2132402) (← links)
- Enumerating \(k\)-arc-connected orientations (Q2211357) (← links)
- The representation of partially-concurrent open shop problems (Q2398435) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
- Acyclic reorientation lattices and their lattice quotients (Q6103840) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)