Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality (Q1836675): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4096964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hypergraphs without significant cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563939 / rank
 
Normal rank

Latest revision as of 18:08, 13 June 2024

scientific article
Language Label Description Also known as
English
Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
scientific article

    Statements

    Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality (English)
    0 references
    1982
    0 references
    0 references
    weighted intersection graph
    0 references
    characteristic number
    0 references
    cyclomatic number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references