Readability of Some Stariike Trees

Research output: Contribution to journalArticlepeer-review


A graph H is called e-realizable if there exists a graph G such that the neighbourhood of any edge of G (i.e. the subgraph of G induced by all vertices adjacent to at least one end vertex of this edge) is isomorphic to H. We show that certain starlike trees (graphs homeomorphic to stars) with short branches are not e-realizable.

Original languageEnglish (US)
Pages (from-to)81-83
Number of pages3
JournalAnnals of Discrete Mathematics
Issue numberC
StatePublished - Jan 1 1992
Externally publishedYes

Fingerprint Dive into the research topics of 'Readability of Some Stariike Trees'. Together they form a unique fingerprint.

Cite this