Counting \(K_4\)-subdivisions (Q2515581): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5589866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(3n-5\) edges do force a subdivision of \(K_5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 14:45, 10 July 2024

scientific article
Language Label Description Also known as
English
Counting \(K_4\)-subdivisions
scientific article

    Statements

    Counting \(K_4\)-subdivisions (English)
    0 references
    0 references
    0 references
    0 references
    5 August 2015
    0 references
    counting \(K_4\)-subdivisions
    0 references
    cycles
    0 references
    3-connected graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references