A reconstrability conjecture for graphs with restrictions for 4-vertex simple paths

zbMATH Open1249.05269MaRDI QIDQ3115189FDOQ3115189

Authors: Pavel Skums, Regina Iosifovna Tyshkevich 

Publication date: 20 February 2012

Recommendations

• Graph reconstruction conjecture: reductions using complement, connectivity and distance
• scientific article; zbMATH DE number 772776
• On the reconstruction of graph invariants
• Graph reconstruction from subgraphs
• The reconstruction conjecture for finite simple graphs and associated directed graphs

zbMATH Keywords

disconnected graphreconstruction conjecturereducible graph1-decomposable graphtidy graph

Mathematics Subject Classification ID

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

Cited In (5)

• Operator Decomposition of Graphs and the Reconstruction Conjecture
• Graph reconstruction conjecture: reductions using complement, connectivity and distance
• Title not available (Why is that?)
• Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles
• \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs

This page was built for publication: A reconstrability conjecture for graphs with restrictions for 4-vertex simple paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115189)