Pages that link to "Item:Q1613435"
From MaRDI portal
The following pages link to The vertex-cover polynomial of a graph (Q1613435):
Displaying 16 items.
- A survey on recurrence relations for the independence polynomial of hypergraphs (Q343776) (← links)
- On the location of roots of graph polynomials (Q740260) (← links)
- An extension of the bivariate chromatic polynomial (Q1041177) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- An algorithm for calculating the independence and vertex-cover polynomials of a graph (Q2383889) (← links)
- The drop polynomial of a weighted digraph (Q2399350) (← links)
- Properties of vertex cover obstructions (Q2455575) (← links)
- The universal edge elimination polynomial and the dichromatic polynomial (Q2857322) (← links)
- On the coefficients of the vertex cover polynomials of cycles (Q2915793) (← links)
- A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
- CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS (Q5055038) (← links)
- On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs (Q5080284) (← links)
- A Most General Edge Elimination Polynomial (Q5302041) (← links)
- Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)
- On the non-commuting graph of the group \(U_{6n}\) (Q6618032) (← links)
- Fractional vertex cover reliability of graphs (Q6625090) (← links)
