Pages that link to "Item:Q5558479"
From MaRDI portal
The following pages link to An inequality for the chromatic number of a graph (Q5558479):
Displayed 27 items.
- Upper bound for linear arboricity (Q809087) (← links)
- Dense trees: a new look at degenerate graphs (Q849635) (← links)
- Some generalizations of theorems on vertex coloring (Q855855) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- Lower bounds on the signed domination numbers of directed graphs (Q1025527) (← links)
- Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763) (← links)
- Heawood inequalities (Q1092918) (← links)
- The book thickness of a graph (Q1136775) (← links)
- Critically partitionable graphs. I (Q1136783) (← links)
- A comparison of bounds for the chromatic number of a graph (Q1159685) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- Chromatic number and skewness (Q1214432) (← links)
- Chromatic partitions of a graph (Q1263595) (← links)
- On graphs \(G\) for which all large trees are \(G\)-good (Q1313348) (← links)
- Relaxed chromatic numbers of graphs (Q1323496) (← links)
- Chromatic scheduling and frequency assignment (Q1327228) (← links)
- Bounds on eigenvalues and chromatic numbers (Q1377497) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- Uncolorable mixed hypergraphs (Q1962044) (← links)
- An inequality for the group chromatic number of a graph (Q2462377) (← links)
- Inequalities involving the irredundance number of a graph (Q2576844) (← links)
- Estimation of sparse hessian matrices and graph coloring problems (Q3690096) (← links)
- Consecutive colorings of graphs (Q3770560) (← links)
- (Q4229265) (← links)
- (Q4719322) (← links)
- Graph theory (Q5917392) (← links)