The following pages link to Mina Nahvi (Q2011156):
Displaying 11 items.
- (Q526809) (redirect page) (← links)
- Graphs with integer matching polynomial zeros (Q526810) (← links)
- On sizes of 1-cross intersecting set pair systems (Q820485) (← links)
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number (Q2011157) (← links)
- Looking within and reaching out: outreach, friendship, and community in the University of Illinois at Urbana-Champaign AWM student chapter (Q2098618) (← links)
- Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784) (← links)
- Some criteria for a signed graph to have full rank (Q2185913) (← links)
- 3-regular graphs are 2-reconstructible (Q2225421) (← links)
- Mixed paths and cycles determined by their spectrum (Q2282791) (← links)
- \(3\)-reconstructibility of rooted trees (Q2694954) (← links)
- Saturation numbers for Berge cliques (Q6201892) (← links)
