Edmonds polytopes and a hierarchy of combinatorial problems
type: Item
instance of: scholarly article
title: Edmonds polytopes and a hierarchy of combinatorial problems
zbMATH Open document ID: 0253.05131
DOI: 10.1016/0012-365X(73)90167-2
author: Yanyan Li
published in: Discrete Mathematics
publication date: 1973-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52B05
zbMATH DE Number: 3399277
Wikidata QID: Q59699141
MaRDI profile type: Publication
cites work: Letter to the Editor—A Note on the Branch-and-Bound Principle
cites work: Q5615282
cites work: Hypergraphs and Ramseyian Theorems
cites work: Remarks on a Problem of Moser
cites work: Edmonds polytopes and weakly hamiltonian graphs
cites work: Q5632593
cites work: The complexity of theorem-proving procedures
cites work: Minimum partition of a matroid into independent subsets
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: Q4414633
cites work: Q5661340
cites work: Some remarks on the theory of graphs
cites work: Anti-blocking polyhedra
cites work: Q5545303
cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
cites work: Q5592263
cites work: Q3236252
cites work: Q5595961
cites work: Q4142699
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: A characterization of perfect graphs
cites work: The Factorization of Linear Graphs
cites work: Integral Extreme Points
full work available at URL: 0012-365x(73)90167-2
OpenAlex ID: W2145243417
description: scientific article