Boolean sum of graphs and reconstruction up to complementation
From MaRDI portal
Publication:2861359
DOI10.1515/apam-2013-0010zbMath1276.05065OpenAlexW2002340571MaRDI QIDQ2861359
Hamza Si Kaddour, Gérard Lopez, Jamel Dammak, Maurice Pouzet
Publication date: 12 November 2013
Published in: Advances in Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/apam-2013-0010
Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (7)
Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ Reconstruction of a coloring from its homogeneous sets ⋮ The \((\leq 5)\)-hypomorphy of digraphs up to complementation ⋮ \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets ⋮ Finite orders which are reconstructible up to duality by their comparability graphs ⋮ Equality of graphs up to complementation ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
This page was built for publication: Boolean sum of graphs and reconstruction up to complementation
