OFFSET
1,3
REFERENCES
F. Harary and E. Palmer, Graphical Enumeration, Academic Press, 1973, section 3.2.
LINKS
StackExchange, Trees with odd degree sequence.
EXAMPLE
When n=2 we have four vertices in the tree and the path graph does not qualify, as it contains two nodes of degree two, but the star with a center node connected to three neighboring nodes qualifies (degrees three and one are both odd).
CROSSREFS
KEYWORD
nonn
AUTHOR
Marko Riedel, Jan 15 2015
STATUS
approved