Chordal 2‐Connected Graphs and Spanning Trees (Q5495883): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Undirected simple connected graphs with minimum number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network transformations and bounding network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of \(P_4\)-free chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reliability-improving graph transformation with applications to network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting labelled chordal graphs / rank
 
Normal rank

Latest revision as of 20:27, 8 July 2024

scientific article; zbMATH DE number 6327046
Language Label Description Also known as
English
Chordal 2‐Connected Graphs and Spanning Trees
scientific article; zbMATH DE number 6327046

    Statements

    Chordal 2‐Connected Graphs and Spanning Trees (English)
    0 references
    7 August 2014
    0 references
    chordal graph
    0 references
    spanning tree
    0 references
    enumeration of trees
    0 references
    threshold graph
    0 references
    minimization
    0 references
    shift transformation
    0 references

    Identifiers