3-Degenerate induced subgraph of a planar graph
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gu, Yangyan | - |
dc.contributor.author | Kierstead, H.A. | - |
dc.contributor.author | Sang-il Oum | - |
dc.contributor.author | Qi, Hao | - |
dc.contributor.author | Zhu, Xuding | - |
dc.date.accessioned | 2022-03-04T09:36:23Z | - |
dc.date.available | 2022-03-04T09:36:23Z | - |
dc.date.created | 2021-10-05 | - |
dc.date.issued | 2022-02 | - |
dc.identifier.issn | 0364-9024 | - |
dc.identifier.uri | https://pr.ibs.re.kr/handle/8788114/11195 | - |
dc.description.abstract | 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.). | - |
dc.language | 영어 | - |
dc.publisher | John Wiley and Sons Inc | - |
dc.title | 3-Degenerate induced subgraph of a planar graph | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.identifier.wosid | 000697382400001 | - |
dc.identifier.scopusid | 2-s2.0-85115268129 | - |
dc.identifier.rimsid | 76481 | - |
dc.contributor.affiliatedAuthor | Sang-il Oum | - |
dc.identifier.doi | 10.1002/jgt.22740 | - |
dc.identifier.bibliographicCitation | Journal of Graph Theory, v.99, no.2, pp.251 - 277 | - |
dc.relation.isPartOf | Journal of Graph Theory | - |
dc.citation.title | Journal of Graph Theory | - |
dc.citation.volume | 99 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 251 | - |
dc.citation.endPage | 277 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.subject.keywordAuthor | graph degeneracy | - |
dc.subject.keywordAuthor | planar graph | - |