The connectivity of acyclic orientation graphs
From MaRDI portal
Publication:1584217
DOI10.1016/S0012-365X(97)00201-XzbMath0955.05064OpenAlexW1985403606MaRDI QIDQ1584217
Carla D. Savage, Cun-Quan Zhang
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00201-x
Related Items (2)
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ Ribbon tilings and multidimensional height functions
Cites Work
- Unnamed Item
- On the graph structure of convex polyhedra in \(n\)-space
- Flows and generalized coloring theorems in graphs
- A new proof of the theorem by Fleischner
- The prism of the acyclic orientation graph is Hamiltonian
- Acyclic orientations of complete bipartite graphs
- Bounds of the number of disjoint spanning trees
- On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
- The square of every two-connected graph is Hamiltonian
- A Partial Order on the Regions of R n Dissected by Hyperplanes
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Supereulerian graphs: A survey
- Generating Linear Extensions Fast
This page was built for publication: The connectivity of acyclic orientation graphs
