Pages that link to "Item:Q5558479"
From MaRDI portal
The following pages link to An inequality for the chromatic number of a graph (Q5558479):
Displaying 50 items.
- Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts (Q418854) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Independent sets in graphs (Q501998) (← links)
- The signed \(k\)-domination number of directed graphs (Q632269) (← links)
- 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)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406) (← links)
- Bounds and conjectures for the signless Laplacian index of graphs (Q968999) (← 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)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← 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)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Uncolorable mixed hypergraphs (Q1962044) (← links)
- Colorings in digraphs from the spectral radius (Q2080237) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- Analytic methods for uniform hypergraphs (Q2250784) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- On indicated chromatic number of graphs (Q2361087) (← links)
- Group connectivity and group colorings of graphs --- a survey (Q2430307) (← links)
- An inequality for the group chromatic number of a graph (Q2462377) (← links)
- Inequalities involving the irredundance number of a graph (Q2576844) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Estimation of sparse hessian matrices and graph coloring problems (Q3690096) (← links)
- Consecutive colorings of graphs (Q3770560) (← links)
- (Q4229265) (← links)
- Improved bounds for the chromatic index of graphs and multigraphs (Q4719322) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- A Relaxed Version of the Erdős–Lovász Tihany Conjecture (Q5272646) (← links)
- Graph theory (Q5917392) (← links)
- Threshold-based network structural dynamics (Q5918636) (← links)
- Threshold-based network structural dynamics (Q5925585) (← links)
