- Daphne Der-Fen Liu, Serguei Norine, Zhishi Pan, Xuding Zhu. Circular consecutive choosability of ::::k::::-choosable graphs. Journal of Graph Theory, 67(3):178-197, 2011.
- Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos. Strengthening Erdös-Pósa property for minor-closed graph classes. Journal of Graph Theory, 66(3):235-240, 2011.
- Xiao-Dong Zhang. Vertex degrees and doubly stochastic graph matrices. Journal of Graph Theory, 66(2):104-114, 2011.
- Terry A. McKee. When every ::::k::::-cycle has at least ::::f::::(::::k::::) chords. Journal of Graph Theory, 68(2):137-147, 2011.
- Oleg V. Borodin, Anna O. Ivanova. Acyclic 5-choosability of planar graphs without adjacent short cycles. Journal of Graph Theory, 68(2):169-176, 2011.
- Iain Moffatt. A characterization of partially dual graphs. Journal of Graph Theory, 67(3):198-217, 2011.
- Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito. The existence of a 2-factor in ::::K::::::1, ::::n::::::-free graphs with large connectivity and large edge-connectivity. Journal of Graph Theory, 68(1):77-89, 2011.
- Tsai-Lien Wong, Xuding Zhu. Total weight choosability of graphs. Journal of Graph Theory, 66(3):198-212, 2011.
- Yahya Ould Hamidoune, Anna S. Lladó, S. C. López. Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. Journal of Graph Theory, 67(2):124-138, 2011.
- Oleg V. Borodin, Anna O. Ivanova. List strong linear 2-arboricity of sparse graphs. Journal of Graph Theory, 67(2):83-90, 2011.