The following pages link to Acyclic orientations of graphs (Q2559389):
Displaying 50 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs (Q276208) (← links)
- Generating all the acyclic orientations of an undirected graph (Q294704) (← links)
- Generalized Dehn-Sommerville relations for hypergraphs (Q300489) (← links)
- The domination polynomial of a graph at \(-1\) (Q367055) (← links)
- Order polynomials and Pólya's enumeration theorem. (Q405267) (← links)
- On the cyclically fully commutative elements of Coxeter groups. (Q438738) (← links)
- Group pinning consensus under fixed and randomly switching topologies with acyclic partition (Q480089) (← links)
- On weak chromatic polynomials of mixed graphs (Q489344) (← links)
- Maximizing proper colorings on graphs (Q490999) (← links)
- The odd-even invariant for graphs (Q491743) (← links)
- A bivariate chromatic polynomial for signed graphs (Q497310) (← links)
- An inequality for Tutte polynomials (Q532122) (← links)
- Some inequalities for the Tutte polynomial (Q627930) (← links)
- Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs (Q659806) (← links)
- Ehrhart theory, modular flow reciprocity, and the Tutte polynomial (Q663242) (← links)
- The active bijection for graphs (Q670651) (← links)
- Partial graph orientations and the Tutte polynomial (Q679543) (← links)
- A note on a counting problem arising in percolation theory (Q685697) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- A decision support system for vine growers based on a Bayesian network (Q736744) (← links)
- Oriented gain graphs, line graphs and eigenvalues (Q739113) (← links)
- Chromatic polynomials of complements of bipartite graphs (Q742569) (← links)
- Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function (Q785786) (← links)
- The acyclic sets of an oriented matroid (Q795053) (← links)
- Acyclic reorientations of weakly oriented matroids (Q810030) (← links)
- Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements (Q857417) (← links)
- The number of nowhere-zero flows on graphs and signed graphs (Q859616) (← links)
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system (Q875070) (← links)
- Principal \(\Gamma\)-cone for a tree (Q884434) (← links)
- Combinatorics of diagrams of permutations (Q889522) (← links)
- Set maps, umbral calculus, and the chromatic polynomial (Q932680) (← links)
- Tutte polynomials for counting and classifying orbits (Q960916) (← links)
- Binomial edge ideals and conditional independence statements (Q990762) (← links)
- Functions of random walks on hyperplane arrangements (Q990770) (← links)
- Linear stationary control systems over the Boolean semiring and their graphs of modules (Q1007046) (← links)
- The number of small covers over cubes (Q1007195) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- A bijection for Eulerian-equivalence classes of totally cyclic orientations (Q1015438) (← links)
- Affine and toric hyperplane arrangements (Q1016537) (← links)
- The homology of the cyclic coloring complex of simple graphs (Q1024364) (← links)
- Monomial bases for broken circuit complexes (Q1041597) (← links)
- The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: the fully optimal basis of a bounded region (Q1041606) (← links)
- The chromatic polynomial of an unlabeled graph (Q1059638) (← links)
- Legal coloring of graphs (Q1079578) (← links)
- The asymptotic number of acyclic digraphs. I (Q1080860) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- Graphical Eulerian numbers and chromatic generating functions (Q1101460) (← links)
- Chromatic polynomials and network reliability (Q1104334) (← links)
- Counting acyclic digraphs by sources and sinks (Q1126301) (← links)
