Polyhedral characterizations and perfection of line graphs
From MaRDI portal
(Redirected from Publication:1382259)
The authors consider line graphs of multigraphs and give a polyhedral characterization of them. They also give polyhedral characterizations of perfect, \(t\)-perfect and \(h\)-perfect line graphs.
Cites work
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Geometric algorithms and combinatorial optimization
- Graphe représentatif des arêtes d'un multigraphe
- scientific article; zbMATH DE number 3675952 (Why is no real title available?)
- scientific article; zbMATH DE number 3499169 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Line perfect graphs
- Matching theory
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Maximum matching and a polyhedron with 0,1-vertices
- On graphs whose least eigenvalue exceeds -1-2
Cited in
(7)- Clique family inequalities for the stable set polytope of quasi-line graphs.
- On perfect linegraph squares
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- Line-Polar Graphs: Characterization and Recognition
- On claw-free t-perfect graphs
- Toric rings of perfectly matchable subgraph polytopes
- A note on kernels and Sperner's Lemma
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)
