Nearly acyclic graphs are reconstructible

DOI10.1002/jgt.3190020105zbMath0379.05043OpenAlexW2042813868MaRDI QIDQ4159408

Joseph M. Weinstein, Bennet Manvel

Publication date: 1978

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

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (5)

On the complexity of graph reconstruction ⋮ Unnamed Item ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A reduction of the graph reconstruction conjecture ⋮ On the reconstruction of graph invariants

Cites Work

• A congruence theorem for trees
• Reconstructing colored graphs
• Reconstruction of Trees

This page was built for publication: Nearly acyclic graphs are reconstructible