Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
From MaRDI portal
Publication:1197003
DOI10.1016/0012-365X(92)90623-NzbMath0783.05070OpenAlexW2048487659MaRDI QIDQ1197003
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90623-n
incidence matrixchromatic numberstrong perfect graph conjectureclique sizelinear perfect matricesstar cutsets
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
A mickey-mouse decomposition theorem, Square-free perfect graphs., Testing balancedness and perfection of linear matrices, Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations, Odd cycles and matrices with integrality properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing balancedness and perfection of linear matrices
- Topics on perfect graphs
- Recognizing claw-free perfect graphs
- Star-cutsets and perfect graphs
- An algorithm for finding clique cut-sets
- Properties of balanced and perfect matrices
- Structural properties and decomposition of linear balanced matrices
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- On certain polytopes associated with graphs
- Odd cycles and matrices with integrality properties
- Compositions for perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- On a Class of Totally Unimodular Matrices
- Structural properties and recognition of restricted and strongly unimodular matrices
- Perfect zero–one matrices
- The Strong Perfect Graph Conjecture for Planar Graphs
