The following pages link to Babak Farzad (Q324853):
Displayed 15 items.
- A hierarchical network formation model (Q324854) (← links)
- Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← links)
- On the edge-density of 4-critical graphs (Q624211) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- Forced orientation of graphs (Q2471507) (← links)
- Backbone colourings of graphs (Q2629282) (← links)
- The chromatic number of random lifts of (Q2840555) (← links)
- Random Lifts of $K_5\backslashe$ are 3-Colorable (Q2902895) (← links)
- Social and Economic Network Formation: A Dynamic Model (Q2942433) (← links)
- Planar Graphs without 7-Cycles Are 4-Choosable (Q3583295) (← links)
- (Q5389994) (← links)
- (Q5414563) (← links)
- Good edge-labelings and graphs with girth at least five (Q6227573) (← links)
- Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem (Q6236746) (← links)