Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems (Q1199123): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3050438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph reconstruction—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems for hypergraph degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of non-reconstructible hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More non-reconstructible hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758829 / rank
 
Normal rank

Latest revision as of 16:11, 16 May 2024

scientific article
Language Label Description Also known as
English
Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
scientific article

    Statements

    Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems (English)
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    reconstructing
    0 references
    hypergraphs
    0 references
    triple systems
    0 references
    Paley graphs
    0 references
    0 references