Abstract
We show that the lattice graphs (grids) and one other family of graphs are characterized by the properties of being reduced, not having 3-claws, and having disconnected µ-graphs.
Original language | English |
---|---|
Pages (from-to) | 49-54 |
Number of pages | 6 |
Journal | Discrete Mathematics |
Volume | 124 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 1994 |