Bichromatic P 4 -composition schemes for perfect orderability

作者: R.B. Hayward , W.J. Lenhart

DOI: 10.1016/S0166-218X(03)00367-6

关键词:

摘要: A P4 is an induced path with four vertices. bichromatic composition scheme as follows: (1) start two graphs vertex sets of different colour, say black • and white ∘, (2) select a set allowable four-vertex sequences, for example {••••, ∘∘∘∘, •∘∘•, ∘••∘}, (3) add edges between the so that in composed graph each coloured sequence. Answering question Chvatal, we determine all such schemes which preserve perfect orderability.

参考文章(10)
Anna Lubiw, Doubly lexical orderings of matrices SIAM Journal on Computing. ,vol. 16, pp. 854- 879 ,(1987) , 10.1137/0216057
Chính T. Hoàng, On the complexity of recognizing a class of perfectly orderable graphs Discrete Applied Mathematics. ,vol. 66, pp. 219- 226 ,(1996) , 10.1016/0166-218X(94)00162-7
C. T. Hoàng, N. Khouzam, On brittle graphs Journal of Graph Theory. ,vol. 12, pp. 391- 404 ,(1988) , 10.1002/JGT.3190120310
V. Chvátal, C. T. Hoàng, N. V. R. Mahadev, D. De Werra, Four classes of perfectly orderable graphs Journal of Graph Theory. ,vol. 11, pp. 481- 495 ,(1987) , 10.1002/JGT.3190110405
Vašek Chvátal, William J Lenhart, Najiba Sbihi, Two-colourings that decompose perfect graphs Journal of Combinatorial Theory, Series B. ,vol. 49, pp. 1- 9 ,(1990) , 10.1016/0095-8956(90)90061-4
Ryan B. Hayward, Bull-Free Weakly Chordal Perfectly Orderable Graphs Graphs and Combinatorics. ,vol. 17, pp. 479- 500 ,(2001) , 10.1007/PL00013413
Matthias Middendorf, Frank Pfeiffer, On the complexity of recognizing perfectly orderable graphs Discrete Mathematics. ,vol. 80, pp. 327- 333 ,(1990) , 10.1016/0012-365X(90)90251-C
Ryan B Hayward, Weakly triangulated graphs Journal of Combinatorial Theory, Series B. ,vol. 39, pp. 200- 208 ,(1985) , 10.1016/0095-8956(85)90050-4
Chính T. Hoàng, Xiaodan Tu, On the perfect orderability of unions of two graphs Journal of Graph Theory. ,vol. 33, pp. 32- 43 ,(2000) , 10.1002/(SICI)1097-0118(200001)33:1<>1.0.CO;2-5
D Seinsche, On a property of the class of n-colorable graphs Journal of Combinatorial Theory, Series B. ,vol. 16, pp. 191- 193 ,(1974) , 10.1016/0095-8956(74)90063-X