3-Degenerate induced subgraph of a planar graph

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 324
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorGu, Yangyanko
dc.contributor.authorKierstead, H. A.ko
dc.contributor.authorOum, Sang-ilko
dc.contributor.authorQi, Haoko
dc.contributor.authorZhu, Xudingko
dc.date.accessioned2021-12-15T06:40:08Z-
dc.date.available2021-12-15T06:40:08Z-
dc.date.created2021-10-05-
dc.date.created2021-10-05-
dc.date.created2021-10-05-
dc.date.issued2022-02-
dc.identifier.citationJOURNAL OF GRAPH THEORY, v.99, no.2, pp.251 - 277-
dc.identifier.issn0364-9024-
dc.identifier.urihttp://hdl.handle.net/10203/290663-
dc.description.abstractA 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.languageEnglish-
dc.publisherWILEY-
dc.title3-Degenerate induced subgraph of a planar graph-
dc.typeArticle-
dc.identifier.wosid000697382400001-
dc.identifier.scopusid2-s2.0-85115268129-
dc.type.rimsART-
dc.citation.volume99-
dc.citation.issue2-
dc.citation.beginningpage251-
dc.citation.endingpage277-
dc.citation.publicationnameJOURNAL OF GRAPH THEORY-
dc.identifier.doi10.1002/jgt.22740-
dc.contributor.localauthorOum, Sang-il-
dc.contributor.nonIdAuthorGu, Yangyan-
dc.contributor.nonIdAuthorKierstead, H. A.-
dc.contributor.nonIdAuthorQi, Hao-
dc.contributor.nonIdAuthorZhu, Xuding-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorgraph degeneracy-
dc.subject.keywordAuthorplanar graph-
dc.subject.keywordPlus2-COLORING NUMBER-
dc.subject.keywordPlusINDUCED FORESTS-
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