scientific article
From MaRDI portal
Publication:3142912
zbMath0782.04001MaRDI QIDQ3142912
Gérard Lopez, Jean Guillaume Hagendorf
Publication date: 9 January 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) ⋮ Unnamed Item ⋮ The \((\leq 6)\)-half-reconstructibility of digraphs ⋮ Prechains and self duality ⋮ \((\leq k)\)-reconstructible binary relations ⋮ The \((\leq 5)\)-hypomorphy of digraphs up to complementation ⋮ The \(C_{3}\)-structure of the tournaments. ⋮ The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\) ⋮ \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) ⋮ Finite orders which are reconstructible up to duality by their comparability graphs ⋮ The half-isomorphy and the finite strongly connected tournaments ⋮ Hypomorphy of graphs up to complementation ⋮ Half-isomorphy, selfduality and finite non strongly connected tournaments ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
This page was built for publication:
