3-Degenerate induced subgraph of a planar graph

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 107
  • Download : 0
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.
Publisher
WILEY
Issue Date
2022-02
Language
English
Article Type
Article
Citation

JOURNAL OF GRAPH THEORY, v.99, no.2, pp.251 - 277

ISSN
0364-9024
DOI
10.1002/jgt.22740
URI
http://hdl.handle.net/10203/290663
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0