3-Degenerate induced subgraph of a planar graph

Yangyan Gu,Hal A. Kierstead,Sang-il Oum,Hao Qi,Xuding Zhu

JOURNAL OF GRAPH THEORY（2022）

引用 0|浏览3

暂无评分

摘要

A graph G is d-degenerate if every nonnull subgraph of G has a vertex of degree at most d. We prove that every n-vertex planar graph has a 3-degenerate induced subgraph of order at least 3 n / 4.

查看译文

关键词

graph degeneracy, planar graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要