Acyclic polynomials of graphs

Related Items (1)

Almost unimodal and real-rooted graph polynomials

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Computing the permanent of (some) complex matrices
The decycling number of generalized Petersen graphs
The Brown-Colbourn conjecture on zeros of reliability polynomials is false
On the complexity of generalized chromatic polynomials
On the location of roots of graph polynomials
The \(f\)-vector of a representable-matroid complex is log-concave
The roots of the independence polynomial of a clawfree graph
Independence polynomials of circulants with an application to music
An extension of the bivariate chromatic polynomial
Large induced degenerate subgraphs
On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
On the Eneström-Kakeya theorem and its sharpness
Complement reducible graphs
On acyclic colorings of planar graphs
Hermite-Biehler, Routh-Hurwitz, and total positivity
Linear time solvable optimization problems on graphs of bounded clique-width
Central limit theorems from the roots of probability generating functions
On the roots of all-terminal reliability polynomials
Graph Polynomials and Their Applications II: Interrelations and Interpretations
On the Real Roots of Domination Polynomials
A Linear Recognition Algorithm for Cographs
Hard Enumeration Problems in Geometry and Combinatorics
Roots of the Reliability Polynomials
Location of Zeros of Chromatic and Related Polynomials of Graphs
Decycling graphs
Integers, Polynomials, and Rings
Zeros of Reliability Polynomials and f-vectors of Matroids
Large Induced Forests in Graphs
Introduction to Domination Polynomial of a Graph
Reducibility among Combinatorial Problems
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
A Most General Edge Elimination Polynomial
On Weakly Distinguishing Graph Polynomials
Decycling Cartesian Products of Two Cycles

This page was built for publication: Acyclic polynomials of graphs