The 2-reconstructible indecomposable graphs.

DOI10.1016/J.CRMA.2007.05.028zbMATH Open1120.05062OpenAlexW2021865407MaRDI QIDQ997977FDOQ997977

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

Recommendations

• Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs)
• All graphs are set reconstructible if all 2-connected graphs are set reconstructible.
• scientific article; zbMATH DE number 4023330
• The reconstruction conjecture for finite simple graphs and associated directed graphs
• The \((\leq k)\)-half-reconstructability of graphs for \(7\leq k\leq 12\).

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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

Cited In (4)

• Title not available (Why is that?)
• Primality, criticality and minimality problems in trees
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs)

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

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