Characterizing N+-perfect line graphs
From MaRDI portal
Publication:2968506
DOI10.1111/itor.12275zbMath1358.05238arXiv1505.04072OpenAlexW2964297757MaRDI QIDQ2968506
Graciela L. Nasini, Mariana S. Escalante, Annegret K. Wagler
Publication date: 16 March 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04072
Related Items (3)
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs ⋮ On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets ⋮ Lovász-Schrijver PSD-Operator on Claw-Free Graphs
Cites Work
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- The strong perfect graph theorem
- Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture
- Characterizing and bounding the imperfection ratio for some classes of graphs
- The ellipsoid method and its consequences in combinatorial optimization
- Near-perfect matrices
- On certain polytopes associated with graphs
- The stable set problem and the lift-and-project ranks of graphs
- Antiwebs are rank-perfect
- Applying Lehman's theorems to packing problems
- On rank-perfect subclasses of near-bipartite graphs
- Near-perfect graphs with polyhedral
- Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On the Shannon capacity of a graph
- Maximum matching and a polyhedron with 0,1-vertices
- Unnamed Item
This page was built for publication: Characterizing N+-perfect line graphs
