The connected partition lattice of a graph and the reconstruction conjecture

DOI10.1002/jgt.22481zbMath1495.05193OpenAlexW2957388536WikidataQ123189153 ScholiaQ123189153MaRDI QIDQ5110651

Bhalchandra D. Thatte

Publication date: 21 May 2020

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22481

zbMATH Keywords

polynomial invariantsgraph reconstructionconnected partition latticeinduced subgraph poset

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Marked Graphs and the Chromatic Symmetric Function ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs

This page was built for publication: The connected partition lattice of a graph and the reconstruction conjecture