Naeem N. Sheikh

According to our database, Naeem N. Sheikh authored at least 8 papers between 2007 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

An Erdős-Ko-Rado Type Theorem via the Polynomial Method.

Kyung-Won Hwang, Younjin Kim, Naeem N. Sheikh

Symmetry, 2020

2009

<i>M</i>-degrees of quadrangle-free planar graphs.

Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu

J. Graph Theory, 2009

Decompositions of quadrangle-free planar graphs.

Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh

Discuss. Math. Graph Theory, 2009

A note on convex subsets of Z^k.

Kyung-Won Hwang, Naeem N. Sheikh

Discret. Math., 2009

Planar graphs decomposable into a forest and a matching.

Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh

Discret. Math., 2009

A Note on Divisibility of the Number of Matchings of a Family of Graphs.

Kyung-Won Hwang, Naeem N. Sheikh, Stephen G. Hartke

Electron. J. Comb., 2009

2008

Decomposing a planar graph with girth 9 into a forest and a matching.

Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu

Eur. J. Comb., 2008

2007

Intersection families and Snevily's conjecture.

Kyung-Won Hwang, Naeem N. Sheikh

Eur. J. Comb., 2007