scientific article; zbMATH DE number 1186914

MaRDI QIDQ3840134zbMATH OpenFDO

Authors S. Lando

Publication date 1 February 1999

zbMATH Keywords

Hopf algebraslinkloopTutte decomposition

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Review text

A graph may contain loops and multiple edges. An edge which is not a loop is a link. Deleting and contracting a link in a graph determines an equivalence relation in the abelian group freely generated by graphs. Modulo this relation a graph is equivalent to the sum of itself with deleted edge and itself with contracted edge. Tutte's theorem claims that any graph is equivalent to a unique linear combination of graphs without links. It is proved that this combination is also unique for graphs with weighted vertices and edges. For the entire collection see [Zbl 0892.00020].

Recommendations

• A Tutte decomposition for matrices and bimatroids
• Tutte uniqueness and Tutte equivalence
• On graphs determined by their Tutte polynomials
• Reconstruction and higher-dimensional geometry
• Tutte polynomials of vertex-weighted graphs and group cohomology

Cited in

(4)

• On a Hopf algebra in graph theory
• A Tutte decomposition for matrices and bimatroids
• Constructions of pairs of Tutte-equivalent graphs.
• Reconstruction and higher-dimensional geometry

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840134)