Some results on the reconstruction problems. <i>p</i>‐claw‐free, chordal, and <i>p</i><sub>4</sub>‐reducible graphs (Q4842708): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3975132 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A congruence theorem for trees / rank | |||
Normal rank | |||
Latest revision as of 16:14, 23 May 2024
scientific article; zbMATH DE number 786114
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
