g属图的页数为0(平方根g)

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science Pub Date : 1988-10-24 DOI:10.1109/SFCS.1988.21962

S. Malitz

{"title":"g属图的页数为0(平方根g)","authors":"S. Malitz","doi":"10.1109/SFCS.1988.21962","DOIUrl":null,"url":null,"abstract":"A book embedding of a graph consists of a linear ordering of the vertices along the spine of a book and an assignment of edges to pages so that edges on the same page do not intersect. The minimum number of pages in which a graph can be embedded is its pagenumber. The following results are presented: (1) any graph of genus g has pagenumber O( square root g); and (2) most n-vertex d-regular graphs have pagenumber Omega ( square root dn/sup 1/2-1/d/).<<ETX>>","PeriodicalId":113255,"journal":{"name":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Genus g graphs have pagenumber O( square root g)\",\"authors\":\"S. Malitz\",\"doi\":\"10.1109/SFCS.1988.21962\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A book embedding of a graph consists of a linear ordering of the vertices along the spine of a book and an assignment of edges to pages so that edges on the same page do not intersect. The minimum number of pages in which a graph can be embedded is its pagenumber. The following results are presented: (1) any graph of genus g has pagenumber O( square root g); and (2) most n-vertex d-regular graphs have pagenumber Omega ( square root dn/sup 1/2-1/d/).<<ETX>>\",\"PeriodicalId\":113255,\"journal\":{\"name\":\"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1988.21962\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1988.21962","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

图的图书嵌入包括沿书脊的顶点的线性排序和对页的边的分配，以便同一页上的边不相交。图可以嵌入的最小页数是它的页码。得到如下结果:(1)g属的任意图的页数为0(平方根g);(2)大多数n顶点d正则图的页数为Omega(√dn/sup 1/2-1/d/)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Genus g graphs have pagenumber O( square root g)

A book embedding of a graph consists of a linear ordering of the vertices along the spine of a book and an assignment of edges to pages so that edges on the same page do not intersect. The minimum number of pages in which a graph can be embedded is its pagenumber. The following results are presented: (1) any graph of genus g has pagenumber O( square root g); and (2) most n-vertex d-regular graphs have pagenumber Omega ( square root dn/sup 1/2-1/d/).<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science

自引率

0.00%

发文量

期刊最新文献

Combinatorial complexity bounds for arrangements of curves and surfaces Genus g graphs have pagenumber O( square root g) Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs Covering polygons is hard New upper bounds in Klee's measure problem