Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets (Q4915386): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Symmetric matroid polytopes and their generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some upper bounds for the diameters of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blending simple polytopes at faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters of Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>d</i>-Step Conjecture and Its Relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(d\)-step conjecture for polyhedra of dimension \(d<6\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3087203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3433805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875887 / rank
 
Normal rank

Latest revision as of 08:08, 6 July 2024

scientific article; zbMATH DE number 6152635
Language Label Description Also known as
English
Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets
scientific article; zbMATH DE number 6152635

    Statements

    Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets (English)
    0 references
    0 references
    0 references
    10 April 2013
    0 references
    polytopes
    0 references
    diameter
    0 references
    Hirsch conjecture
    0 references
    oriented matroids
    0 references
    satisfiability
    0 references

    Identifiers

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