A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series-parallel graphs that are equistable, generalizing results of Mahadev et al. about equistable out
β¦ LIBER β¦
Series-parallel graphs: A logical approach
β Scribed by T. A. McKee
- Publisher
- John Wiley and Sons
- Year
- 1983
- Tongue
- English
- Weight
- 297 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
The notions "series-parallel" and "nonseparable" are shown to be logical converses of each other when formulated in a particular dual-like fashion. Self-dual circuitkutset characterizations are given of series-parallel and of series-parallel nonseparable graphs.
π SIMILAR VOLUMES
Equistable seriesβparallel graphs
β
Ephraim Korach; Uri N. Peled
π
Article
π
2003
π
Elsevier Science
π
English
β 163 KB
Colouring series-parallel graphs
β
P. D. Seymour
π
Article
π
1990
π
Springer-Verlag
π
English
β 634 KB
Chromaticity of series-parallel graphs
β
K.M. Koh; C.P. Teo
π
Article
π
1996
π
Elsevier Science
π
English
β 454 KB
By applying a sequence of edge-gluings on a set of cycles each of length k, we obtain a special series-parallel graph. The well-known k-gon tree theorem (see [l, lo]) states that these graphs form a X-equivalence class. Many of the other known classes of X-unique graphs and X-equivalence classes are
A compact labeling scheme for series-par
β
George Steiner
π
Article
π
1985
π
Elsevier Science
π
English
β 731 KB
Series-parallel subgraphs of planar grap
β
Ehab S. Elmallah; Charles J. Colbourn
π
Article
π
1992
π
John Wiley and Sons
π
English
β 435 KB
Combinatorial problems on series-paralle
β
K. Takamizawa; T. Nishizeki; N. Saito
π
Article
π
1981
π
Elsevier Science
π
English
β 238 KB