Some results on the reconstruction problems. <i>p</i>‐claw‐free, chordal, and <i>p</i><sub>4</sub>‐reducible graphs (Q4842708)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some results on the reconstruction problems. p‐claw‐free, chordal, and p4‐reducible graphs |
scientific article; zbMATH DE number 786114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some results on the reconstruction problems. <i>p</i>‐claw‐free, chordal, and <i>p</i><sub>4</sub>‐reducible graphs |
scientific article; zbMATH DE number 786114 |
Statements
Some results on the reconstruction problems. <i>p</i>‐claw‐free, chordal, and <i>p</i><sub>4</sub>‐reducible graphs (English)
0 references
16 August 1995
0 references
reconstruction problems
0 references
isomorphism
0 references
claw
0 references
claw-point
0 references
edge reconstructible
0 references
chordal graphs
0 references
edge reconstructibility
0 references
claw-free graphs
0 references
vertex reconstructibility
0 references
0.8807975
0 references
0.8765316
0 references
0.8721596
0 references
0.87020504
0 references
0.8666776
0 references
0.8572825
0 references
0.85478765
0 references
