scientific article
From MaRDI portal
Publication:2857431
zbMath1274.05188MaRDI QIDQ2857431
Arnaud Pêcher, Annegret K. Wagler
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001843
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Cites Work
- Unnamed Item
- The ellipsoid method and its consequences in combinatorial optimization
- A class of facet producing graphs for vertex packing polyhedra
- On certain polytopes associated with graphs
- Antiwebs are rank-perfect
- On rank-perfect subclasses of near-bipartite graphs
- Anti-blocking polyhedra
- Clique and chromatic number of circular-perfect graphs
- On the Shannon capacity of a graph
- Circular perfect graphs
- Blocking and anti-blocking pairs of polyhedra
This page was built for publication:
