3-Degenerate induced subgraph of a planar graph

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

Research output: Contribution to journalArticlepeer-review


A graph (Formula presented.) is (Formula presented.) -degenerate if every nonnull subgraph of (Formula presented.) has a vertex of degree at most (Formula presented.). We prove that every (Formula presented.) -vertex planar graph has a 3-degenerate induced subgraph of order at least (Formula presented.).

Original languageEnglish (US)
Pages (from-to)251-277
Number of pages27
JournalJournal of Graph Theory
Issue number2
StatePublished - Feb 2022


  • graph degeneracy
  • planar graph

ASJC Scopus subject areas

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of '3-Degenerate induced subgraph of a planar graph'. Together they form a unique fingerprint.

Cite this