Abstract
There exist graphs of arbitrarily high girth and absolutely bounded degree which cannot be induced subgraphs of an irreducible Cayley graph.
Original language | English (US) |
---|---|
Pages (from-to) | 239-241 |
Number of pages | 3 |
Journal | Combinatorica |
Volume | 3 |
Issue number | 2 |
DOIs | |
State | Published - Jun 1983 |
Keywords
- AMS subject classification (1980): 05C25
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics