On the reconstruction of graph invariants
From MaRDI portal
Publication:2851492
DOI10.1016/j.endm.2009.07.062zbMath1273.05145arXiv0905.1915OpenAlexW2146937162MaRDI QIDQ2851492
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.1915
Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The interlace polynomial of a graph
- Reconstructing colored graphs
- A weighted graph polynomial from chromatic invariants of knots
- On the reconstruction of graph invariants
- Graph reconstruction—a survey
- Nearly acyclic graphs are reconstructible
- A Most General Edge Elimination Polynomial
This page was built for publication: On the reconstruction of graph invariants
