Skip to search formSkip to main contentSkip to account menu

Acyclic orientation

In graph theory, an acyclic orientation of an undirected graph is an assignment of a direction to each edge (an orientation) that does not form any… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In the distributed message passing model a communication network is represented by an n-vertex graph G = (V,E) of maximum degree… 
2002
2002
  • J. Oxley, D. Welsh
  • Combinatorics, Probability and Computing
  • 2002
  • Corpus ID: 14918970
We study the complexity of computing the coefficients of three classical polynomials, namely the chromatic, flow and reliability… 
Review
1999
Review
1999
  • D. Welsh
  • Random Struct. Algorithms
  • 1999
  • Corpus ID: 7996276
This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new… 
Highly Cited
1997
1996
1996
An upper bound is given on the number of acyclic orientations of a graph, in terms of the spectrum of its Laplacian. It is shown… 
Highly Cited
1995
Highly Cited
1995
Highly Cited
1991
Highly Cited
1990
Highly Cited
1990
Highly Cited
1988
Highly Cited
1988
  • G. Kalai
  • J. Comb. Theory, Ser. A
  • 1988
  • Corpus ID: 40286762
1986
1986
  • N. Linial
  • Discret. Math.
  • 1986
  • Corpus ID: 204987695