Title of article
On unretractive graphs
Author/Authors
Kaschek، نويسنده , , Roland، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
10
From page
41
To page
50
Abstract
This extended abstract gives necessary and sufficient conditions for both lexicographic products and arbitrary graphs to be unretractive.
Keywords
lexicographic product , Automorphism group , wreath product , graphs , unretractive graphs
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454247
Link To Document