Title of article :
Perfectly Orderable P4 Composition
Author/Authors :
Hayward، نويسنده , , Ryan B. and Lenhart، نويسنده , , William J.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Pages :
4
From page :
190
To page :
193
Abstract :
A P4 composition scheme is as follows: start with two graphs with vertex sets of different colours, say black • and white ○ select a set of allowable four-vertex colour sequences, for example {••••, ○○○○, •○○•, ○••○}; add edges between the graphs so that in the composed graph each four-vertex induced path is coloured with an allowable sequence. Answering a question of Chvétal, we determine all such schemes which preserve perfect orderability.
Keywords :
P4 graph composition , perfect order , perfectly orderable
Journal title :
Electronic Notes in Discrete Mathematics
Serial Year :
2001
Journal title :
Electronic Notes in Discrete Mathematics
Record number :
1453147
Link To Document :
بازگشت