Pages that link to "Item:Q1907103"
From MaRDI portal
The following pages link to On the cover polynomial of a digraph (Q1907103):
Displaying 20 items.
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs (Q276208) (← links)
- Complexity and approximability of the cover polynomial (Q445242) (← links)
- The algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphs (Q658003) (← links)
- Rook theory and cycle-counting permutation statistics (Q705229) (← links)
- Set maps, umbral calculus, and the chromatic polynomial (Q932680) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- An interpretation for Garsia and Remmel's \(q\)-hit numbers (Q1380346) (← links)
- Factorization of the cover polynomial (Q1386473) (← links)
- Cycles and perfect matchings. (Q1421514) (← links)
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. (Q1584467) (← links)
- Generalized rook polynomials (Q1584670) (← links)
- The cycle-path indicator polynomial of a digraph (Q1585495) (← links)
- Further investigation involving rook polynomials with only real zeros (Q1590216) (← links)
- On an ordering-dependent generalization of the Tutte polynomial (Q1675352) (← links)
- Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\) (Q1865262) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function (Q1961224) (← links)
- Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs (Q1979871) (← links)
- Tutte polynomials for directed graphs (Q2284730) (← links)
- The drop polynomial of a weighted digraph (Q2399350) (← links)