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
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.3190190409 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998173219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

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

    Identifiers