Perfect (0, 1)-matrices and perfect bidirected graphs

DOI10.1016/S0304-3975(99)00203-0MaRDI QIDQ1978718zbMATHOpenAlexFDO

Authors Yanyan Li

Publication date 4 June 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00203-0

zbMATH Keywords

polytopesperfectnessbidirected graphs\((0,\pm 1)\)-matrices

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Publication:4729827
• Matrix partitions of perfect graphs
• Perfect \(0,\pm 1\) matrices
• On perfect \(0,\pm 1\) matrices
• Perfect non-commuting graphs of matrices over chains
• \(\beta\)-perfect graphs
• \(i\gamma(1)\)-perfect graphs
• scientific article; zbMATH DE number 867633
• Pivots, determinants, and perfect matchings of graphs
• scientific article; zbMATH DE number 846971

Cites work

• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
• Binary integer programs with two variables per inequality
• Degree-two Inequalities, Clique Facets, and Biperfect Graphs
• Geometric algorithms and combinatorial optimization
• Normal hypergraphs and the perfect graph conjecture
• On certain polytopes associated with graphs
• Perfect \(0,\pm 1\) matrices
• Perfect and ideal \(0, \pm 1\) matrices
• Perfect zero–one matrices
• Star-cutsets and perfect graphs
• THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(1)

• scientific article; zbMATH DE number 2188437 (Why is no real title available?)

This page was built for publication: Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs

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