3‐Degenerate induced subgraph of a planar graph.
In: Journal of Graph Theory, Jg. 99 (2022-02-01), Heft 2, S. 251-277
Online
academicJournal
Zugriff:
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 3n∕4. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Graph Theory is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Titel: |
3‐Degenerate induced subgraph of a planar graph.
|
---|---|
Autor/in / Beteiligte Person: | Gu, Yangyan ; Kierstead, H. A. ; Oum, Sang‐il ; Qi, Hao ; Zhu, Xuding |
Link: | |
Zeitschrift: | Journal of Graph Theory, Jg. 99 (2022-02-01), Heft 2, S. 251-277 |
Veröffentlichung: | 2022 |
Medientyp: | academicJournal |
ISSN: | 0364-9024 (print) |
DOI: | 10.1002/jgt.22740 |
Sonstiges: |
|