Critical edges in perfect line graphs and some polyhedral consequences

DOI10.1016/S0166-218X(99)00093-1MaRDI QIDQ1302180zbMATH OpenOpenAlexFDO

Authors Annegret K. Wagler

Publication date 13 March 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00093-1

zbMATH Keywords

bipartite graphcharacterizationcritical edgesfacetsimperfect subgraphsline graphperfect graphstable set polytope

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 2044950
• Rank-perfect and weakly rank-perfect graphs
• On critical edges in minimal imperfect graphs
• On critically perfect graphs

Cited in

(5)

• Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
• Rank-perfect and weakly rank-perfect graphs
• Reverse lexicographic squarefree initial ideals and Gorenstein Fano polytopes
• scientific article; zbMATH DE number 2044950 (Why is no real title available?)
• On critically perfect graphs

This page was built for publication: Critical edges in perfect line graphs and some polyhedral consequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302180)