Integrality properties of edge path tree families (Q1043594): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Converting Linear Programs to Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear-Time Algorithm for Graph Realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphes de chaînes d'aretes d'un arbre / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient PQ-graph algorithm for solving the graph-realization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330973 / rank
 
Normal rank

Latest revision as of 07:15, 2 July 2024

scientific article
Language Label Description Also known as
English
Integrality properties of edge path tree families
scientific article

    Statements

    Integrality properties of edge path tree families (English)
    0 references
    0 references
    9 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    ideal
    0 references
    Mengerian
    0 references
    edge path tree families
    0 references
    EPT family
    0 references
    0 references