Pages that link to "Item:Q5501213"

The following pages link to Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem (Q5501213):

Displaying 12 items.

• Definability in the substructure ordering of simple graphs (Q259729) (← links)
• On 3-stable number conditions in \(n\)-connected claw-free graphs (Q724867) (← links)
• A characterization of some graphs which do not contain 3-claws (Q1313824) (← links)
• The \((\leq 5)\)-hypomorphy of digraphs up to complementation (Q1713868) (← links)
• \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets (Q1741582) (← links)
• Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
• Equality of graphs up to complementation (Q2023760) (← links)
• Hypomorphy of graphs up to complementation (Q2519016) (← links)
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
• Reconstruction of a coloring from its homogeneous sets (Q2680357) (← links)
• Some results on the reconstruction problems. <i>p</i>‐claw‐free, chordal, and <i>p</i>₄‐reducible graphs (Q4842708) (← links)
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)