Isomorphy up to complementation
From MaRDI portal
Publication:286755
DOI10.4310/JOC.2016.V7.N2.A5zbMath1336.05090arXiv1501.05181OpenAlexW2964185495MaRDI QIDQ286755
Maurice Pouzet, Hamza Si Kaddour
Publication date: 25 May 2016
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.05181
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (6)
Hereditary classes of ordered binary structures ⋮ Finite orders which are reconstructible up to duality by their comparability graphs ⋮ Some relational structures with polynomial growth and their associated algebras II: Finite generation ⋮ Equality of graphs up to complementation ⋮ Siblings of an $\aleph_0$-categorical relational structure ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
This page was built for publication: Isomorphy up to complementation
