Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9514623 | Electronic Notes in Discrete Mathematics | 2005 | 10 Pages |
Abstract
This extended abstract gives necessary and sufficient conditions for both lexicographic products and arbitrary graphs to be unretractive.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roland Kaschek,