3-Degenerate induced subgraph of a planar graph

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

doi:10.1002/jgt.22740

3-Degenerate induced subgraph of a planar graph

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

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English (US)
Pages (from-to)	251-277
Number of pages	27
Journal	Journal of Graph Theory
Volume	99
Issue number	2
DOIs	https://doi.org/10.1002/jgt.22740
State	Published - Feb 2022

Keywords

graph degeneracy
planar graph

ASJC Scopus subject areas

Geometry and Topology
Discrete Mathematics and Combinatorics

Access to Document

10.1002/jgt.22740

Cite this

@article{1af73887479741689b58d4c50816b157,

title = "3-Degenerate induced subgraph of a planar graph",

abstract = "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.).",

keywords = "graph degeneracy, planar graph",

author = "Yangyan Gu and Kierstead, {H. A.} and Oum, {Sang il} and Hao Qi and Xuding Zhu",

note = "Publisher Copyright: {\textcopyright} 2021 Wiley Periodicals LLC",

year = "2022",

month = feb,

doi = "10.1002/jgt.22740",

language = "English (US)",

volume = "99",

pages = "251--277",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "2",

}

TY - JOUR

T1 - 3-Degenerate induced subgraph of a planar graph

AU - Gu, Yangyan

AU - Kierstead, H. A.

AU - Oum, Sang il

AU - Qi, Hao

AU - Zhu, Xuding

PY - 2022/2

Y1 - 2022/2

N2 - 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.).

AB - 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.).

KW - graph degeneracy

KW - planar graph

UR - http://www.scopus.com/inward/record.url?scp=85115268129&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85115268129&partnerID=8YFLogxK

U2 - 10.1002/jgt.22740

DO - 10.1002/jgt.22740

M3 - Article

AN - SCOPUS:85115268129

SN - 0364-9024

VL - 99

SP - 251

EP - 277

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 2

ER -

3-Degenerate induced subgraph of a planar graph

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this