The Strong Perfect Graph Conjecture states that a graph is perfect iff neither it nor its complement contains an odd chordless cycle of size greater than or equal to 5. In this article it is shown that many families of graphs are complete for this conjecture in the sense that the conjecture is true
β¦ LIBER β¦
Proof of the strong 2-Cover Conjecture for planar graphs
β Scribed by Herbert Fleischner
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 76 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Families of graphs complete for the stro
β
D. G. Corneil
π
Article
π
1986
π
John Wiley and Sons
π
English
β 381 KB
π 1 views
A proof of Golomb's conjecture for the d
β
Johannes Mykkeltveit
π
Article
π
1972
π
Elsevier Science
π
English
β 261 KB
The validity of the strong perfect-graph
β
K.R Parthasarathy; G Ravindra
π
Article
π
1979
π
Elsevier Science
π
English
β 205 KB
A Proof of a Conjecture for the Number o
β
I.P. Goulden; D.M. Jackson
π
Article
π
1999
π
Elsevier Science
π
English
β 136 KB
An explicit expression is obtained for the generating series for the number of ramified coverings of the sphere by the torus, with elementary branch points and prescribed ramification type over infinity. This proves a conjecture of Goulden, Jackson, and Vainshtein for the explicit number of such cov
New Upper Bound for the B-Spline Basis C
β
K Scherer; A.Yu Shadrin
π
Article
π
1999
π
Elsevier Science
π
English
β 116 KB
A proof of the generalized Nakayama conj
β
Peter DrΓ€xler; Dieter Happel
π
Article
π
1992
π
Elsevier Science
π
English
β 206 KB