论文信息 - Evaluations of the Circuit Partition Polynomial

Evaluations of the Circuit Partition Polynomial

J. A. Ellis-Monaghan (1998, J. Combin. Theory Ser. B74, 326?352) used Hopf algebra techniques to prove some beautiful combinatorial interpretations of the Martin polynomial for unoriented graphs. Our aim here is to give very simple proofs of similar interpretations for a considerably wider class of values. The results look particularly simple when formulated for a trivial transform of the Martin polynomial, the circuit partition polynomial.

Béla Bollobás | B. Bollobás

[1] Pierre Martin,et al. Enumérations eulériennes dans les multigraphes et invariants de Tutte-Grothendieck , 1977 .

[2] André Bouchet,et al. Multimatroids III. Tightness and Fundamental Graphs , 2001, Eur. J. Comb..

[3] Béla Bollobás,et al. The interlace polynomial: a new graph polynomial , 2000, SODA '00.

[4] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[5] Joanna A. Ellis-Monaghan. New Results for the Martin Polynomial , 1998, J. Comb. Theory, Ser. B.

[6] Michel LasVergnas,et al. On the evaluation at (3,3) of the Tutte polynomial of a graph , 1988 .

[7] M. L. Vergnas,et al. Le Polynôme De Martin D'un Graphe Eulerien , 1983 .

[8] Pierre Martin,et al. Remarkable valuation of the dichromatic polynomial of planar multigraphs , 1978, J. Comb. Theory, Ser. B.

[9] André Bouchet,et al. Tutte-martin polynomials and orienting vectors of isotropic systems , 1991, Graphs Comb..

[10] François Jaeger,et al. On Tutte polynomials and cycles of plane graphs , 1987, J. Comb. Theory, Ser. B.

[11] Michel Las Vergnas,et al. On the evaluation at (3, 3) of the Tutte polynomial of a graph , 1988, J. Comb. Theory, Ser. B.