论文标题
平面图的3级诱导子图
3-degenerate induced subgraph of a planar graph
论文作者
论文摘要
图形$ g $是$ d $ degenerate，如果每个非零子图$ g $最多都有$ d $的顶点。 我们证明，每个$ n $ vertex Planar图都有$ 3 $ - 定位诱导的订单子图，至少$ 3N/4 $。
A graph $G$ is $d$-degenerate if every non-null 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 $3n/4$.
