Boolean sum of graphs and reconstruction up to complementation

DOI10.1515/APAM-2013-0010MaRDI QIDQ2861359zbMATH OpenOpenAlexFDO

Authors Jamel Dammak, Gérard Lopez, Maurice Pouzet, Hamza Si Kaddour

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

zbMATH Keywords

Boolean sum of graphscyclehypomorphy up to complementationpathreconstruction up to complementation

Mathematics Subject Classification ID

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

Recommendations

• Hypomorphy of graphs up to complementation
• scientific article; zbMATH DE number 1156601
• The \((\leq 5)\)-hypomorphy of digraphs up to complementation
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• Equality of graphs up to complementation

Cited in

(14)

• 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
• Hypomorphy of graphs up to complementation
• Reconstruction of a coloring from its homogeneous sets
• Isomorphy up to complementation
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• scientific article; zbMATH DE number 1156601 (Why is no real title available?)
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
• Morphology of the connected components of the Boolean sum of two digraphs ( 5)-hypomorphic up to complementation
• Minimal reconstructions of a coloring from its homogeneous sets
• The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)

This page was built for publication: Boolean sum of graphs and reconstruction up to complementation

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