The vertex-cover polynomial of a graph

DOI10.1016/S0012-365X(01)00272-2zbMath1007.05079OpenAlexW2098003532MaRDI QIDQ1613435

Michael D. Hendy, Charles H. C. Little, Kee L. Teo, Fengming Dong

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00272-2

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS, A Most General Edge Elimination Polynomial, A Dichotomy Theorem for Polynomial Evaluation, An algorithm for calculating the independence and vertex-cover polynomials of a graph, A survey on recurrence relations for the independence polynomial of hypergraphs, The drop polynomial of a weighted digraph, On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs, INDUCED CYCLE POLYNOMIAL OF A GRAPH, The zero forcing polynomial of a graph, Unnamed Item, Linear Recurrence Relations for Graph Polynomials, On the location of roots of graph polynomials, An extension of the bivariate chromatic polynomial