淡江大學機構典藏:Item 987654321/55467
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62830/95882 (66%)
Visitors : 4038505      Online Users : 565
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/55467


    Title: Adaptable chromatic number of graph products
    Authors: Pavol Hell;Pan, Zhishi;Wong, Tsai-Lien;Zhu, Xuding
    Contributors: 淡江大學數學學系
    Keywords: Chromatic number;Adaptable chromatic number;Categorical product;Cartesian product;Categorical power;Cartesian power
    Date: 2009-11
    Issue Date: 2011-08-22 16:18:41 (UTC+8)
    Publisher: Amsterdam: Elsevier BV * North-Holland
    Abstract: A colouring of the vertices of a graph (or hypergraph) G is adapted to a given colouring of the edges of G if no edge has the same colour as both (or all) its vertices. The adaptable chromatic number of G is the smallest integer k such that each edge-colouring of G by colours 1,2,…,k admits an adapted vertex-colouring of G by the same colours 1,2,…,k. (The adaptable chromatic number is just one more than a previously investigated notion of chromatic capacity.) The adaptable chromatic number of a graph G is smaller than or equal to the ordinary chromatic number of G. While the ordinary chromatic number of all (categorical) powers Gk of G remains the same as that of G, the adaptable chromatic number of Gk may increase with k. We conjecture that for all sufficiently large k the adaptable chromatic number of Gk equals the chromatic number of G. When G is complete, we prove this conjecture with k≥4, and offer additional evidence suggesting it may hold with k≥2. We also discuss other products and propose several open problems.
    Relation: Discrete Mathematics 309(21), pp.6153-6159
    DOI: 10.1016/j.disc.2009.05.029
    Appears in Collections:[Graduate Institute & Department of Mathematics] Journal Article

    Files in This Item:

    File Description SizeFormat
    0012-365X_309(21)p6153-6159.pdf525KbAdobe PDF144View/Open
    Adaptable chromatic number of graph products.pdf525KbAdobe PDF1View/Open
    index.html0KbHTML209View/Open
    index.html0KbHTML130View/Open
    index.html0KbHTML143View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback