Pages that link to "Item:Q3506313"
From MaRDI portal
The following pages link to New bounds for the chromatic number of graphs (Q3506313):
Displaying 10 items.
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Bounds for chromatic number in terms of even-girth and booksize (Q616000) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs (Q2243130) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- On lower bounds for the chromatic number in terms of vertex degree (Q2275368) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)
