Adjacency of vertices of the complete pre-order polytope (Q1377754): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes, graphs, and complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem and a class of polyhedra of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacency relation on the traveling salesman polytope is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3991025 / rank
 
Normal rank

Latest revision as of 10:31, 28 May 2024

scientific article
Language Label Description Also known as
English
Adjacency of vertices of the complete pre-order polytope
scientific article

    Statements

    Adjacency of vertices of the complete pre-order polytope (English)
    0 references
    26 January 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complete pre-order
    0 references
    polytope
    0 references
    convex hull
    0 references
    adjacency relation
    0 references
    digraph
    0 references
    diameter
    0 references