The 2-reconstructible indecomposable graphs.

DOI10.1016/j.crma.2007.05.028zbMath1120.05062OpenAlexW2021865407MaRDI QIDQ997977

Abdelhak Chaïchaâ, Abderrahim Boussaïri

Publication date: 10 August 2007

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2007.05.028

Mathematics Subject Classification ID

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

Related Items (3)

Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ Primality, criticality and minimality problems in trees ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs)
• The minimal non-\((\leqslant k)\)-reconstructible relations
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• L'Indeformabilite des Relations et Multirelations Binaires

This page was built for publication: The 2-reconstructible indecomposable graphs.