Pages that link to "Item:Q2707978"
From MaRDI portal
The following pages link to New upper bounds for the chromatic number of a graph (Q2707978):
Displaying 20 items.
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309) (← links)
- Three new upper bounds on the chromatic number (Q765327) (← links)
- New results on chromatic index critical graphs (Q1043537) (← links)
- Upper bounds of entire chromatic number of plane graphs (Q1294064) (← links)
- Bounds on eigenvalues and chromatic numbers (Q1377497) (← links)
- New construction of graphs with high chromatic number and small clique number (Q1702354) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Index of parameters of iterated line graphs (Q2142662) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Improved upper bound for the degenerate and star chromatic numbers of graphs (Q2410096) (← links)
- New upper bound on the chromatic number of the square of a planar graph (Q2824258) (← links)
- New approximation guarantee for chromatic number (Q2931386) (← links)
- New bounds for the chromatic number of graphs (Q3506313) (← links)
- A new upper bound for the harmonious chromatic number (Q4242954) (← links)
- (Q4504215) (← links)
- (Q4559881) (← links)
- New Algorithm for Chromatic Number of Graphs and their Applications (Q5220289) (← links)
- New Bounds for the Dichromatic Number of a Digraph (Q5377790) (← links)
- Algorithmic bounds for the chromatic number† (Q5449019) (← links)
- (Q6150893) (← links)