Premium
Every connected, locally connected graph is upper embeddable
Author(s) -
Nebeský Ladislav
Publication year - 1981
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190050211
Subject(s) - mathematics , combinatorics , graph , upper and lower bounds , connected component , connectivity , discrete mathematics , mathematical analysis
In this Note it is proved that every connected, locally connected graph is upper embeddable. Moreover, a lower bound for the maximum genus of the square of a connected graph is given.