DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gu, Yangyan | ko |
dc.contributor.author | Kierstead, H. A. | ko |
dc.contributor.author | Oum, Sang-il | ko |
dc.contributor.author | Qi, Hao | ko |
dc.contributor.author | Zhu, Xuding | ko |
dc.date.accessioned | 2021-12-15T06:40:08Z | - |
dc.date.available | 2021-12-15T06:40:08Z | - |
dc.date.created | 2021-10-05 | - |
dc.date.created | 2021-10-05 | - |
dc.date.created | 2021-10-05 | - |
dc.date.issued | 2022-02 | - |
dc.identifier.citation | JOURNAL OF GRAPH THEORY, v.99, no.2, pp.251 - 277 | - |
dc.identifier.issn | 0364-9024 | - |
dc.identifier.uri | http://hdl.handle.net/10203/290663 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.publisher | WILEY | - |
dc.title | 3-Degenerate induced subgraph of a planar graph | - |
dc.type | Article | - |
dc.identifier.wosid | 000697382400001 | - |
dc.identifier.scopusid | 2-s2.0-85115268129 | - |
dc.type.rims | ART | - |
dc.citation.volume | 99 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 251 | - |
dc.citation.endingpage | 277 | - |
dc.citation.publicationname | JOURNAL OF GRAPH THEORY | - |
dc.identifier.doi | 10.1002/jgt.22740 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Gu, Yangyan | - |
dc.contributor.nonIdAuthor | Kierstead, H. A. | - |
dc.contributor.nonIdAuthor | Qi, Hao | - |
dc.contributor.nonIdAuthor | Zhu, Xuding | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | graph degeneracy | - |
dc.subject.keywordAuthor | planar graph | - |
dc.subject.keywordPlus | 2-COLORING NUMBER | - |
dc.subject.keywordPlus | INDUCED FORESTS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.