Book Thickness of Complete Bipartite graph
碩士 === 國立中正大學 === 數學系研究所 === 107 === We want to discuss the book embedding of graph especially Complete Bipartite graph denoted by Km;n into n-book. We embed Km;n into book by finding the upper bounds and lower bounds of pages to embed that graph. Moreover, we determine the exact book thickness deno...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/4hysnz |