Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
From MaRDI portal
Publication:5501213
zbMath1317.05127arXiv1309.1835MaRDI QIDQ5501213
Hamza Si Kaddour, Maurice Pouzet, Nicolas Trotignon
Publication date: 3 August 2015
Full work available at URL: https://arxiv.org/abs/1309.1835
Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (9)
Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ Reconstruction of a coloring from its homogeneous sets ⋮ 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 ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic ⋮ Definability in the substructure ordering of simple graphs
This page was built for publication: Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem