Finite-type invariants for graphs and graph reconstructions

DOI10.1016/j.aim.2003.08.013zbMath1050.05088OpenAlexW2057359784MaRDI QIDQ1881101

Robin Forman

Publication date: 4 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.aim.2003.08.013

zbMATH Keywords

finite-type invariantgraph reconstructionNash-Williams lemma

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Quotients of Peck posets
• Reconstruction from vertex-switching
• Balance equations for reconstruction problems
• Reconstructing graphs from their k-edge deleted subgraphs
• Combinatorial reconstruction problems
• Reconstruction of k-orbits of a permutation group
• The edge reconstruction hypothesis is true for graphs with more than n log n edges
• On the Nash-Williams' lemma in graph reconstruction theory
• On the Vassiliev knot invariants
• Finite type invariants of 3-manifolds
• Knot polynomials and Vassiliev's invariants
• A characterization of perfect graphs
• FINITE TYPE INVARIANTS OF INTEGRAL HOMOLOGY 3-SPHERES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite-type invariants for graphs and graph reconstructions