Vertex-switching reconstruction of subgraph numbers and triangle-free graphs

DOI10.1016/0095-8956(92)90048-3zbMath0695.05053OpenAlexW2060315338MaRDI QIDQ909676

Gordon F. Royle, Mark N. Ellingham

Publication date: 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90048-3

zbMATH Keywords

triangle-free graphsdisconnected graphsvertex-switching reconstruction

Mathematics Subject Classification ID

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

Related Items (5)

A reconstruction problem related to balance equations ⋮ Degree conditions for vertex switching reconstruction ⋮ Switching reconstruction of digraphs ⋮ Switching Reconstruction of Digraphs ⋮ A reconstruction problem related to balance equations. II: The general case

Cites Work

• Unnamed Item
• Unnamed Item
• Switching reconstruction and diophantine equations
• Reconstruction from vertex-switching
• Balance equations for reconstruction problems
• Reconstructing graphs from their k-edge deleted subgraphs
• A note on the vertex-switching reconstruction
• Graph reconstruction—a survey

This page was built for publication: Vertex-switching reconstruction of subgraph numbers and triangle-free graphs