Opening book details…
Can I read The Connectivity of Minimal Imperfect Graphs on EtoBox?
The Connectivity of Minimal Imperfect Graphs by Seb, Andrs is a Computer Science article available to read on EtoBox.
What is The Connectivity of Minimal Imperfect Graphs about?
We prove that partitionable graphs are 2w -2-connected, that this bound is sharp, and prove some structural properties of cutsets of cardinality 2w -2. The proof of the connectivity result is a simple linear algebraic proof.
Who reads The Connectivity of Minimal Imperfect Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Seb, Andrs
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)
- Published
- 1996
- Language
- EN
- Field
- Computer Science (Physical Sciences)