Google
Dec 1, 2011In this paper we examine substitution instances of ξ ( G ; x , y , z ) and show that among these the dichromatic polynomial Z ( G ; q , v )�...
Abstract. The dichromatic polynomial Z(G; q, v) can be characterized as the most general. C-invariant, i.e., a graph polynomial satisfying a linear�...
In this paper we examine substitution instances of ξ(G;x,y,z)ξ(G;x,y,z) and show that among these the dichromatic polynomial Z(G;q,v)Z(G;q,v) plays a�...
People also ask
Abstract. We establish closed-form expansions for the universal edge elim- ination polynomial of paths and cycles and their generating functions. This.
Missing: Dichromatic | Show results with:Dichromatic
Mar 4, 2014Abstract:We establish closed-form expansions for the universal edge elimination polynomial of paths and cycles and their generating�...
Missing: Dichromatic | Show results with:Dichromatic
The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. by Elena Ravve and I. Averbouch. Electronic Notes in Discrete Mathematics, 2011.
Apr 25, 2024The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. Electron. Notes Discret. Math. 38: 77-82 (2011); 2010. [j1]. view.
2007. The universal edge elimination polynomial and the dichromatic polynomial. I Averbouch, T Kotek, JA Makowsky, E Ravve. Electronic Notes in Discrete�...
We look for graph polynomials which satisfy recurrence re- lations on three kinds of edge elimination: edge deletion, edge contrac- tion and edge extraction�...
The universal edge elimination polynomial and the dichromatic polynomial. I Averbouch, T Kotek, JA Makowsky, E Ravve. Electronic Notes in Discrete Mathematics�...