Line perfect graphs
From MaRDI portal
Cites work
- A characterization of perfect graphs
- Anti-blocking polyhedra
- Blocking and anti-blocking pairs of polyhedra
- Establishing the matching polytope
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3322854 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3420800 (Why is no real title available?)
- scientific article; zbMATH DE number 3060538 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- Normal hypergraphs and the perfect graph conjecture
- On certain polytopes associated with graphs
- Paths, Trees, and Flowers
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
Cited in
(38)- Partial characterizations of coordinated graphs: Line graphs and complements of forests
- Intersection graphs of paths in a tree
- Gallai graphs and anti-Gallai graphs
- Graphical properties related to minimal imperfection
- A class of facet producing graphs for vertex packing polyhedra
- Neighbourhood-perfect line graphs
- Polyhedral characterizations and perfection of line graphs
- On completely positive graphs and their complements
- Completely positive matrices.
- Graph imperfection. I
- On edge perfectness and classes of bipartite graphs
- Open shop scheduling with some additional constraints
- Classes of perfect graphs
- Mutual exclusion scheduling with interval graphs or related classes. II
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Edge identifying codes
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- On line perfect graphs
- A note on chromatic properties of threshold graphs
- Counting weighted independent sets beyond the permanent
- Identifying codes in line graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Bicolored matchings in some classes of graphs
- Bicolored matchings in some classes of graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Minimum weighted clique cover on claw‐free perfect graphs
- Toric rings of perfectly matchable subgraph polytopes
- Dominoes
- Characterization of completely positive graphs
- 11 can be reduced to 10
- The graphs of pyramids are determined by their spectrum
- Matching polytopes, Gorensteinness, and the integer decomposition property
- CP graphs and SPN graphs
- Toric ideals of matching polytopes and edge colorings
- Packing paths perfectly
- The edge intersection graphs of paths in a tree
- \((p,k)\)-coloring problems in line graphs
- Almost nonpreemptive schedules
This page was built for publication: Line perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4141848)
