Pages that link to "Item:Q3506313"
From MaRDI portal
The following pages link to New bounds for the chromatic number of graphs (Q3506313):
Displaying 25 items.
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- 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)
- Three new upper bounds on the chromatic number (Q765327) (← links)
- New results on chromatic index critical graphs (Q1043537) (← links)
- New construction of graphs with high chromatic number and small clique number (Q1702354) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Bounds for the chromatic number of graphs with partial information (Q1869218) (← links)
- On bounding the chromatic number of L-graphs (Q1918550) (← 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)
- A dualistic approach to bounding the chromatic number of a graph (Q2462336) (← links)
- New upper bounds for the chromatic number of a graph (Q2707978) (← links)
- New upper bound on the chromatic number of the square of a planar graph (Q2824258) (← links)
- A tight bound on the set chromatic number (Q2860873) (← links)
- New approximation guarantee for chromatic number (Q2931386) (← links)
- (Q4559881) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- New Algorithm for Chromatic Number of Graphs and their Applications (Q5220289) (← links)
- New Bounds for the Dichromatic Number of a Digraph (Q5377790) (← links)
- Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)
- Upper bounds for some graph invariants in terms of blocks and cut-vertices (Q6657261) (← links)
