Pages that link to "Item:Q2563513"
From MaRDI portal
The following pages link to Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph (Q2563513):
Displaying 10 items.
- Some inequalities for the Tutte polynomial (Q627930) (← links)
- Monomial bases for broken circuit complexes (Q1041597) (← links)
- Acyclic orientations of random graphs (Q1271856) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- Elements of a theory of simulation. II: Sequential dynamical systems. (Q1569128) (← links)
- On the number of forests and connected spanning subgraphs (Q2053728) (← links)
- On the number of upward planar orientations of maximal planar graphs (Q2250457) (← links)
- Upper bound for the number of spanning forests of regular graphs (Q2700981) (← links)
- The acyclic orientation game on random graphs (Q4697816) (← links)
- Exponential growth constants for spanning forests on Archimedean lattices: Values and comparisons of upper bounds (Q4994871) (← links)
