Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,591,302 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
15 relations
Bipolar orientation
Chromatic polynomial
Directed acyclic graph
Dual graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks
Leonid Barenboim
PODC
2015
Corpus ID: 53037736
In the distributed message passing model a communication network is represented by an n-vertex graph G = (V,E) of maximum degree…
Expand
2002
2002
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
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…
Expand
Review
1999
Review
1999
The Tutte polynomial
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…
Expand
Highly Cited
1997
Highly Cited
1997
Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems
G. Kant
,
Xin He
Theor. Comput. Sci.
1997
Corpus ID: 473551
1996
1996
Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
N. Kahalé
,
L. Schulman
Comb.
1996
Corpus ID: 2427408
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…
Expand
Highly Cited
1995
Highly Cited
1995
Bipolar orientations Revisited
H. D. Fraysseix
,
P. D. Mendez
,
P. Rosenstiehl
Discret. Appl. Math.
1995
Corpus ID: 13971864
Highly Cited
1991
Highly Cited
1991
Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices
M. Chrobak
,
D. Eppstein
Theor. Comput. Sci.
1991
Corpus ID: 8491398
Highly Cited
1990
Highly Cited
1990
On the complexity of recognizing perfectly orderable graphs
M. Middendorf
,
F. Pfeiffer
Discret. Math.
1990
Corpus ID: 204988892
Highly Cited
1988
Highly Cited
1988
A simple way to tell a simple polytope from its graph
G. Kalai
J. Comb. Theory, Ser. A
1988
Corpus ID: 40286762
1986
1986
Graph coloring and monotone functions on posets
N. Linial
Discret. Math.
1986
Corpus ID: 204987695
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE