Scholarlink

From this chapter, we will present a series of methods to construct maximal planar graphs. In this chapter, we first introduce a simple but useful operation, called diagonal flip (or edge-flipping), by a finite sequence of which any two maximal planar graphs with the same order can be transformed into each other.

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

Construction of Maximal Planar Graphs with the Same Order

  • 章节

  • 出版模式：

    开放获取

  • 发表日期：

    2025年

查看全文
  • Jin Xu

摘要

From this chapter, we will present a series of methods to construct maximal planar graphs. In this chapter, we first introduce a simple but useful operation, called diagonal flip (or edge-flipping), by a finite sequence of which any two maximal planar graphs with the same order can be transformed into each other.