Prechains and self duality

DOI10.1016/j.disc.2012.01.025zbMath1242.05218OpenAlexW2012994052MaRDI QIDQ418880

Christian Delhommé, Youssef Boudabbous

Publication date: 30 May 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.025

zbMATH Keywords

graph decompositioncircular orderingsself dual binary relation

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Unnamed Item ⋮ \(\{-1\}\)-self dual finite prechains and applications ⋮ The \((\leq 6)\)-half-reconstructibility of digraphs ⋮ \((\leq k)\)-reconstructible binary relations ⋮ Unnamed Item ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of relations. Transl. from the French by P. Clote
• Strongly self-complementary and hereditarily isomorphic tournaments
• 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)
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Decomposition of Directed Graphs
• L'Indeformabilite des Relations et Multirelations Binaires
• La dualité dans la demi-reconstruction des relations binaires finies
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• Sur la détermination d'une relation binaire à partir d'informations locales
• Transitiv orientierbare Graphen

This page was built for publication: Prechains and self duality