Pages that link to "Item:Q5530478"

The following pages link to On chromatic number of graphs and set-systems (Q5530478):

Displayed 47 items.

• Chromatic numbers and Bohr topologies (Q1398200) ‎ (← links)
• Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) ‎ (← links)
• On sets of integers with the Schur property (Q1821785) ‎ (← 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)
• The dichromatic number of a digraph (Q1836671) ‎ (← links)
• On Ramsey - Turan type theorems for hypergraphs (Q1838980) ‎ (← links)
• Coloring face-hypergraphs of graphs on surfaces (Q1850616) ‎ (← links)
• Triplication for BSTSs and uncolourability (Q1876688) ‎ (← links)
• Star chromatic numbers of hypergraphs and partial Steiner triple systems (Q1903717) ‎ (← links)
• Ramsey families which exclude a graph (Q1906854) ‎ (← links)
• On Taylor's problem (Q1912691) ‎ (← links)
• Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109) ‎ (← links)
• The complexity of generalized graph colorings (Q1923585) ‎ (← links)
• Uncolorable mixed hypergraphs (Q1962044) ‎ (← links)
• Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) ‎ (← links)
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl (Q2526108) ‎ (← links)
• Separability properties of almost-disjoint families of sets (Q2555499) ‎ (← links)
• An interpolation theorem for partitions which are complete with respect to hereditary properties (Q2562787) ‎ (← links)
• Colour-critical graphs and hypergraphs (Q2563172) ‎ (← links)
• On the chromatic number of Steiner triple systems of order 25 (Q2568479) ‎ (← links)
• Cuts and bounds (Q2575795) ‎ (← links)
• (Q2741320) ‎ (← links)
• (Q2777505) ‎ (← links)
• A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282) ‎ (← links)
• Applications of a Set-Theoretic Lemma (Q3338916) ‎ (← links)
• On Finite Maximal Antichains in the Homomorphism Order (Q3503497) ‎ (← links)
• Splitting Strongly Almost Disjoint Families (Q3755449) ‎ (← links)
• Embedding Graphs into Colored Graphs (Q3808084) ‎ (← links)
• The existence problem for colour critical linear hypergraphs (Q3861423) ‎ (← links)
• The structure of critical Ramsey graphs (Q3863922) ‎ (← links)
• Coloring Block Designs is NP-Complete (Q3960717) ‎ (← links)
• Coloring Steiner Triple Systems (Q3966168) ‎ (← links)
• A Two-Cardinal Theorem (Q4055631) ‎ (← links)
• The structure of critical Ramsey graphs (Q4190672) ‎ (← links)
• A Coloring Result for the Plane (Q4254577) ‎ (← links)
• Radius two trees specify χ‐bounded classes (Q4284098) ‎ (← links)
• Radius two trees specify χ‐bounded classes (Q4309985) ‎ (← links)
• Turán-Ramsey Theorems and <i>K_p</i>-Independence Numbers (Q4314149) ‎ (← links)
• On the Ramsey Property of Families of Graphs (Q4698771) ‎ (← links)
• Zur Geometrie der Kreislagerungen (Q5537067) ‎ (← links)
• On chromatic number of finite set-systems (Q5540284) ‎ (← links)
• On decomposition of graphs (Q5556306) ‎ (← links)
• A generalization of Kónig's theorem (Q5611639) ‎ (← links)
• Balanced matrices (Q5659570) ‎ (← links)
• On a combinatorial game (Q5905678) ‎ (← links)
• Graph theory (Q5917392) ‎ (← links)