The following pages link to (Q5790850):
Displayed 50 items.
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- Fractional Turan's theorem and bounds for the chromatic number (Q324870) (← links)
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← links)
- Extremal problems for the \(p\)-spectral radius of graphs (Q405309) (← links)
- On saturated \(k\)-Sperner systems (Q405311) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- \(K_{s,t}\)-saturated bipartite graphs (Q482117) (← links)
- Large joints in graphs (Q607362) (← links)
- The fractional chromatic number of Zykov products of graphs (Q617003) (← links)
- On the maximum number of cliques in a graph embedded in a surface (Q648982) (← links)
- Spectra of generalized compositions of graphs and hierarchical networks (Q710577) (← links)
- A problem of Erdős on the minimum number of \(k\)-cliques (Q744160) (← links)
- A simple branching scheme for vertex coloring problems (Q765355) (← links)
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs (Q785799) (← links)
- Perfect graphs of arbitrarily large clique-chromatic number (Q896010) (← links)
- A Nice labelling for tree-like event structures of degree 3 (Q979077) (← links)
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (Q1025926) (← links)
- Local \(k\)-colorings of graphs and hypergraphs (Q1095156) (← links)
- Intersection properties of boxes. I: An upper-bound theorem (Q1107826) (← links)
- Chromatic polynomials for regular graphs and modified wheels (Q1150375) (← links)
- Partitive hypergraphs (Q1160636) (← links)
- Intersection properties of boxes. II: Extremal families (Q1182651) (← links)
- Coefficient relationship between rook and chromatic polynomials (Q1235713) (← links)
- Stirling number identities from chromatic polynomials (Q1248632) (← links)
- A short proof of the existence of highly chromatic hypergraphs without short cycles (Q1260043) (← links)
- Turán's theorem and maximal degrees (Q1306430) (← links)
- The chromaticity of certain graphs with five triangles (Q1313879) (← links)
- Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles (Q1322232) (← links)
- Chromatic equivalence classes of certain generalized polygon trees (Q1366783) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions (Q1663794) (← links)
- Star saturation number of random graphs (Q1699572) (← links)
- On the maximum number of maximum independent sets (Q1756132) (← links)
- Chromatic capacities of graphs and hypergraphs (Q1827711) (← links)
- Many cliques with few edges and bounded maximum degree (Q1984508) (← links)
- General lemmas for Berge-Turán hypergraph problems (Q1987076) (← links)
- On Turán-good graphs (Q2032868) (← links)
- Flag complexes and homology (Q2037172) (← links)
- Some results on \(k\)-Turán-good graphs (Q2037585) (← links)
- The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension (Q2042605) (← links)
- Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions (Q2045366) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- On the independent set sequence of a tree (Q2048555) (← links)
- The inductive graph dimension from the minimum edge clique cover (Q2053725) (← links)
- Hypergraph based Berge hypergraphs (Q2062896) (← links)
- DP color functions versus chromatic polynomials (Q2070081) (← links)
- Generalized Turán problems for complete bipartite graphs (Q2084784) (← links)