IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i2d10.1007_s10878-015-9981-8.html
   My bibliography  Save this article

More bounds for the Grundy number of graphs

Author

Listed:
  • Zixing Tang

    (Xinjiang University)

  • Baoyindureng Wu

    (Xinjiang University)

  • Lin Hu

    (Xinjiang University)

  • Manoucheher Zaker

    (Institute for Advanced Studies in Basic Sciences)

Abstract

A coloring of a graph $$G=(V,E)$$ G = ( V , E ) is a partition $$\{V_1, V_2, \ldots , V_k\}$$ { V 1 , V 2 , … , V k } of V into independent sets or color classes. A vertex $$v\in V_i$$ v ∈ V i is a Grundy vertex if it is adjacent to at least one vertex in each color class $$V_j$$ V j for every $$j

Suggested Citation

  • Zixing Tang & Baoyindureng Wu & Lin Hu & Manoucheher Zaker, 2017. "More bounds for the Grundy number of graphs," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 580-589, February.
    • Handle: RePEc:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9981-8
    DOI: 10.1007/s10878-015-9981-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9981-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9981-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9981-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.