On the cover polynomial of a digraph

From MaRDI portal
Revision as of 14:11, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1907103

DOI10.1006/JCTB.1995.1055zbMath0839.05045OpenAlexW2061138851WikidataQ105723985 ScholiaQ105723985MaRDI QIDQ1907103

Ronald L. Graham, Fan R. K. Chung

Publication date: 5 June 1996

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1055




Related Items (25)

Chip-firing game and a partial Tutte polynomial for Eulerian digraphsThe homogenized Linial arrangement and Genocchi numbersThe drop polynomial of a weighted digraphAn interpretation for Garsia and Remmel's \(q\)-hit numbersOn an ordering-dependent generalization of the Tutte polynomialFactorization of the cover polynomialUniform Algebraic Reducibilities between Parameterized Numeric Graph InvariantsFast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problemsComplexity and approximability of the cover polynomialCycles and perfect matchings.Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric functionThe algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphsSet maps, umbral calculus, and the chromatic polynomialWorpitzky-compatible subarrangements of braid arrangements and cocomparability graphsCUMULANTS IN NONCOMMUTATIVE PROBABILITY THEORY III: CREATION AND ANNIHILATION OPERATORS ON FOCK SPACESRook theory and cycle-counting permutation statisticsThe coloring ideal and coloring complex of a graphTutte polynomials for directed graphsLinear Recurrence Relations for Graph PolynomialsFrom a zoo to a zoology: Towards a general theory of graph polynomialsGraph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.Generalized rook polynomialsThe cycle-path indicator polynomial of a digraphFurther investigation involving rook polynomials with only real zerosVariations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)







This page was built for publication: On the cover polynomial of a digraph