Finite orders which are reconstructible up to duality by their comparability graphs

DOI10.1007/s40840-019-00805-wzbMath1437.05164OpenAlexW2961760053MaRDI QIDQ1988547

Mohammad Alzohairi, Moncef Bouaziz, Youssef Boudabbous, Ahmad H. Sharary

Publication date: 23 April 2020

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-019-00805-w

zbMATH Keywords

comparability graphordered setreconstructionmodular decompositionisomorphism up to duality

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isomorphy up to complementation
• Primitivity is hereditary for 2-structures
• \(P_ 4\)-trees and substitution decomposition
• The \(C_{3}\)-structure of the tournaments.
• Reconstruction of posets with the same comparability graph
• The minimal non-\((\leqslant k)\)-reconstructible relations
• Hypomorphy of graphs up to complementation
• Boolean sum of graphs and reconstruction up to complementation
• Isomorphy and dilatation in digraphs
• HEREDITARY HEMIMORPHY OF {-κ}-HEMIMORPHIC TOURNAMENTS FOR ≥ 5
• Graph reconstruction—a survey
• L'Indeformabilite des Relations et Multirelations Binaires
• RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• Transitiv orientierbare Graphen
• On the Structure of Finite T₀ + T₅ Spaces

This page was built for publication: Finite orders which are reconstructible up to duality by their comparability graphs