An edge of a graph is called critical, if deleting it the stability number of the graph increases, and a nonedge is called co-critical, if adding it to the graph the size of the maximum clique increases. We prove in this paper, that the minimal imperfect graphs containing certain configurations of t
The structure of imperfect critically strongly-imperfect graphs
β Scribed by Elefterie Olaru
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 180 KB
- Volume
- 156
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
The family of all critically strongly-imperfect graphs decomposes in two nonempty classes: perfect and imperfect ones. In this paper we characterize the critically strongly-imperfect graphs which are, simultaneously, imperfect. We prove that these are precisely the holes of odd length ~> 5 or their complements.
π SIMILAR VOLUMES
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.
The critical temperature for superconductivity in tantalum decreeaes with incmzsing concentration of nitrogen, oxygen or hydrogen. The magnitude of the effect melt be correlated with the residual resistivity and thus mey be interpreted 88 being prim8rily e mean free path effect; just as haa been fou
Kevin Bivantis dream is to open a wedding dress shop, a place with the stunning gowns to make every bride-to-be feel adored. At thirty-eight, he quits a successful advertising career to buy an old brownstone in a trendy Boston neighborhood and to make his dream a reality. When one of his cosigners d
IfI,: family of Bar, w) graphs ate of interest for several reasons. For example, any minimal fomenter-example to Rerge's Strong Perfect Graph Conjecture t %ngs to this family. This paper aciounts for ail (4.3) graphs. One of these is not obtainatde by existing techniques for geg~~rati~g (a + I, w) g