Scholarlink

<p>A book embedding of a graph <i>G</i> is a placement of its vertices along the spine of a book, and an assignment of its edges to the pages such that no two edges on the same page cross. The pagenumber of a graph is the minimum number of pages in which it can be embedded. Determining the pagenumber of a graph is NP-hard. A graph is said to be 1-planar if it can be drawn in the plane so that each edge is crossed at most once. The anthors prove that the pagenumber of 1-planar graphs is at most 10.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On the Pagenumber of 1-Planar Graphs

  • 期刊论文

  • 发表日期：

    2025年3月1日

查看全文
  • Xiaxia Guan,
  • Weihua Yang

摘要

A book embedding of a graph G is a placement of its vertices along the spine of a book, and an assignment of its edges to the pages such that no two edges on the same page cross. The pagenumber of a graph is the minimum number of pages in which it can be embedded. Determining the pagenumber of a graph is NP-hard. A graph is said to be 1-planar if it can be drawn in the plane so that each edge is crossed at most once. The anthors prove that the pagenumber of 1-planar graphs is at most 10.