More bounds for the Grundy number of graphs
From MaRDI portal
Publication:511707
DOI10.1007/s10878-015-9981-8zbMath1359.05048arXiv1507.01080OpenAlexW2218870702MaRDI QIDQ511707
Manoucheher Zaker, Lin Hu, Baoyindureng Wu, Zixing Tang
Publication date: 22 February 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.01080
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
Grundy Distinguishes Treewidth from Pathwidth ⋮ Bounds for the Grundy chromatic number of graphs in terms of domination number ⋮ Unnamed Item ⋮ On the geometric-arithmetic index of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First-fit colorings of graphs with no cycles of a prescribed even length
- First-fit chromatic numbers of \(d\)-degenerate graphs
- A proof for a conjecture on the Randić index of graphs with diameter
- On a relation between the Randić index and the chromatic number
- Randić index and coloring number of a graph
- On rigid circuit graphs
- Results on the Grundy chromatic number of graphs
- Grundy number and products of graphs
- Ordered colourings of graphs
- Some perfect coloring properties of graphs
- Trivially perfect graphs
- \(\beta\)-perfect graphs
- On the conjecture of Aouchiche and Hansen about the Randić index
- A survey of Nordhaus-Gaddum type relations
- Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
- On the family of \(r\)-regular graphs with Grundy number \(r+1\)
- Inequalities for the Grundy chromatic number of graphs
- On Complementary Graphs
- New bounds for the chromatic number of graphs
- Inequalities for the first-fit chromatic number
- The Comparability Graph of a Tree
- Series expansion of the directed percolation probability
- On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
- Grundy number of graphs
- The achromatic number of a graph
This page was built for publication: More bounds for the Grundy number of graphs
