Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 380
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorChoi, Ilkyooko
dc.contributor.authorKwon, O-Joungko
dc.contributor.authorOum, Sang-ilko
dc.date.accessioned2017-02-09T08:20:56Z-
dc.date.available2017-02-09T08:20:56Z-
dc.date.created2017-01-29-
dc.date.created2017-01-29-
dc.date.created2017-01-29-
dc.date.issued2017-03-
dc.identifier.citationJOURNAL OF COMBINATORIAL THEORY SERIES B, v.123, pp.126 - 147-
dc.identifier.issn0095-8956-
dc.identifier.urihttp://hdl.handle.net/10203/220433-
dc.description.abstractA fan F-k is a graph that consists of an induced path on k vertices and an additional vertex that is adjacent to all vertices of the path. We prove that for all positive integers q and k, every graph with sufficiently large chromatic number contains either a clique of size q or a vertex-minor isomorphic to F-k. We also prove that for all positive integers q and k >= 3, every graph with sufficiently large chromatic number contains either a clique of size q or a pivot-minor isomorphic to a cycle of length k. (C) 2016 Elsevier Inc. All rights reserved.-
dc.languageEnglish-
dc.publisherACADEMIC PRESS INC ELSEVIER SCIENCE-
dc.titleColoring graphs without fan vertex-minors and graphs without cycle pivot-minors-
dc.typeArticle-
dc.identifier.wosid000393530200005-
dc.identifier.scopusid2-s2.0-85007545274-
dc.type.rimsART-
dc.citation.volume123-
dc.citation.beginningpage126-
dc.citation.endingpage147-
dc.citation.publicationnameJOURNAL OF COMBINATORIAL THEORY SERIES B-
dc.identifier.doi10.1016/j.jctb.2016.11.007-
dc.contributor.localauthorOum, Sang-il-
dc.contributor.nonIdAuthorChoi, Ilkyoo-
dc.contributor.nonIdAuthorKwon, O-Joung-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorChromatic number-
dc.subject.keywordAuthorChi-bounded class-
dc.subject.keywordAuthorVertex-minor-
dc.subject.keywordAuthorPivot-mino-
dc.subject.keywordPlusLARGE CHROMATIC NUMBER-
dc.subject.keywordPlusRANK-WIDTH-
dc.subject.keywordPlusCIRCLE GRAPH-
dc.subject.keywordPlusISOTROPIC SYSTEMS-
dc.subject.keywordPlusINDUCED SUBGRAPHS-
dc.subject.keywordPlusTREES-
dc.subject.keywordPlusOBSTRUCTIONS-
dc.subject.keywordPlusBIPARTITE-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0