상세 보기
AN ELEMENTARY SET FOR EMBEDDED BOUQUET GRAPHS WITH TWO CYCLES
Citations
WEB OF SCIENCE
0Citations
SCOPUS
0초록
A projection of the bouquet graph B with two cycles is said to be trivial if only trivial embeddings are obtained from the projection. In this paper a finite set of nontrivial embeddings of B is shown to be minimal among those which produce all nontrivial projections of B.
키워드
Projection of graph; embedding of graph; bouquet graph; knot projection; PLANAR GRAPHS; PROJECTIONS
- 제목
- AN ELEMENTARY SET FOR EMBEDDED BOUQUET GRAPHS WITH TWO CYCLES
- 저자
- Huh, Youngsik
- 발행일
- 2011-02
- 유형
- Article
- 권
- 20
- 호
- 2
- 페이지
- 305 ~ 325