淡江大學機構典藏:Item 987654321/115408
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62819/95882 (66%)
Visitors : 4004970      Online Users : 599
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/115408


    Title: First-fit chromatic numbers of d-degenerate graphs
    Authors: Gerard Jennhwa Chang;Hsiang-Chun Hsu
    Keywords: First-fit chromatic number;Grundy number
    Date: 2012-07-06
    Issue Date: 2018-10-25 12:11:02 (UTC+8)
    Publisher: Elsevier
    Abstract: The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. In this short note, we first give counterexamples to some results by Balogh et al.
    Relation: Discrete Mathematics 312 (12-13), p.2088-2090
    DOI: 10.1016/j.disc.2012.03.029
    Appears in Collections:[Graduate Institute & Department of Mathematics] Journal Article

    Files in This Item:

    File Description SizeFormat
    First-fit chromatic numbers of d-degenerate graphs.pdf188KbAdobe PDF2View/Open
    index.html0KbHTML90View/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