Trees of Diameter 4

Yu. Yu. Kochetkov ()
Additional contact information
Yu. Yu. Kochetkov: Faculty of Mathematics and Mechanics Moscow State University, Department of Higher Algebra

A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 447-453 from Springer

Abstract: Abstract We will consider plane connected trees up to the isotopy equivalence: two trees are isotopically equivalent, if there exists a continuous orientation preserving deformation of the plane that maps one tree into another. We assume that each tree has a given binary structure, i.e. a coloring of vertices in two colors black and white, such that adjacent vertices have different colors. A type is a (finite) set of all trees, which have the same sets of valences of black and white vertices. If k 1, ... , k s is the set of valences of white vertices and l 1, ... , l t is the set of valences of black vertices, then the corresponding type is denoted as 〈k 1, ... , k s; l 1 ... , l s〉.

Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04166-6_41

Ordering information: This item can be ordered from
http://www.springer.com/9783662041666

DOI: 10.1007/978-3-662-04166-6_41

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().