More bounds for the Grundy number of graphs

Zixing Tang, Baoyindureng Wu (), Lin Hu and Manoucheher Zaker ()
Additional contact information
Zixing Tang: Xinjiang University
Baoyindureng Wu: Xinjiang University
Lin Hu: Xinjiang University
Manoucheher Zaker: Institute for Advanced Studies in Basic Sciences

Journal of Combinatorial Optimization, 2017, vol. 33, issue 2, No 13, 580-589

Abstract: 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

Keywords: Grundy number; Chromatic number; Clique number; Coloring number; Randić index (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9981-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9981-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9981-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().