Polyhedral characterizations and perfection of line graphs
From MaRDI portal
Publication:1382259
DOI10.1016/S0166-218X(97)00081-4zbMATH Open0903.05041MaRDI QIDQ1382259FDOQ1382259
Authors: Dasong Cao, G. L. Nemhauser 
Publication date: 10 December 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Title not available (Why is that?)
- Matching theory
- Geometric algorithms and combinatorial optimization
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Maximum matching and a polyhedron with 0,1-vertices
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- Title not available (Why is that?)
- Graphe représentatif des arêtes d'un multigraphe
- Title not available (Why is that?)
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Line perfect graphs
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
Cited In (7)
- A note on kernels and Sperner's Lemma
- On claw-free \(t\)-perfect graphs
- On perfect linegraph squares
- Toric rings of perfectly matchable subgraph polytopes
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Line-Polar Graphs: Characterization and Recognition
This page was built for publication: Polyhedral characterizations and perfection of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382259)
