The following pages link to Hossein Hajiabolhassan (Q409402):
Displaying 41 items.
- On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
- Hedetniemi's conjecture for Kneser hypergraphs (Q530765) (← links)
- Graph homomorphisms and nodal domains (Q852625) (← links)
- On defining numbers of circular complete graphs (Q864158) (← links)
- Density and power graphs in graph homomorphism problem (Q932664) (← links)
- On the b-chromatic number of Kneser graphs (Q968135) (← links)
- Bounds for visual cryptography schemes (Q968192) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- On colorings of graph powers (Q1043947) (← links)
- A generalization of the Erdős-Ko-Rado theorem (Q1045161) (← links)
- (Q1376075) (redirect page) (← links)
- Uniquely total colorable graphs (Q1376076) (← links)
- Circular chromatic number of Kneser graphs (Q1400965) (← links)
- Uniquely 2-list colorable graphs (Q1613346) (← links)
- Chromatic number of random Kneser hypergraphs (Q1679319) (← links)
- Altermatic number of categorical product of graphs (Q1709531) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- Sparse \(H\)-colourable graphs of bounded maximum degree (Q1889843) (← links)
- Minimal coloring and strength of graphs (Q1974540) (← links)
- Chromatic number via Turán number (Q2012520) (← links)
- On chromatic number and minimum cut (Q2338633) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Circular colouring and algebraic no-homomorphism theorems (Q2372443) (← links)
- Graph powers and graph homomorphisms (Q2380449) (← links)
- Unique list-colourability and the fixing chromatic number of graphs (Q2576344) (← links)
- Tabular graphs and chromatic sum (Q2576829) (← links)
- On the Circular Chromatic Number of Graph Powers (Q2874089) (← links)
- (Q3070347) (← links)
- (Q3115020) (← links)
- (Q3147263) (← links)
- (Q4222076) (← links)
- (Q4222096) (← links)
- Circular chromatic number of subgraphs (Q4432769) (← links)
- Circular chromatic number and Mycielski construction (Q4432770) (← links)
- Graph homomorphisms through random walks (Q4434546) (← links)
- (Q4552197) (← links)
- A generalization of Gale's lemma (Q4575536) (← links)
- (Q4660719) (← links)
- Secure Frameproof Code Through Biclique Cover (Q5403039) (← links)
- A generalization of Kneser's conjecture (Q5891501) (← links)