Guantao Chen

Research Interests

  • Graph Theory and its Applications


  • Precoloring extension of Vizing's Theorem for multigraphs (PDF)
    with Yan Cao, Guangming Jing, Xuli Qi, and Songling Shan

  • Double Vizing fans in critical class two graphs (PDF)
    with Yan Cao and Xuli Qi

  • On the coequal values of total chromatic number and chromatic index (PDF)
    with Yanli Hao

  • Linear arboricity of degenerate graphs (PDF)
    with Yanli Hao and Guoning Yu

  • Overfullness of edge-critical graphs with small minimal core degree (PDF)
    with Yan Cao, Guangming Jing and Songling Shan

  • Proof of the Core Conjecture of Hilton and Zhao (PDF)
    with Yan Cao, Guangming Jing, Songling Shan

  • Proof of the Goldberg-Seymour Conjecture on Edge-Colorings of Multigraphs (PDF)
    with Guangming Jing, Wenan Zang

  • Independence number of edge-chromatic critical graphs (PDF)
    with Yan Cao, Guangming Jing, Songling Shan

  • A characterization of multigraphs attaining maximum chromatic index (PDF)
    with Yan Cao, Shushan He, Guangming Jing



  • Multiplicity of the second-largest eigenvalue of the adjacent matrix of a planar graph
    Journal of Graph Theory, DOI: 10.1002/jgt.22708
    with Yanli Hao

  • A note on Goldberg's conjecture on total chromatic numbers
    Journal of Graph Theory, DOI:10.1002/jgt.22771
    with Yan Cao and Guangming Jing

  • Laminar tight cuts in matching covered graphs
    J. Combin. Theory Ser. B, 150 (2021), 177-194
    with Xing Feng, Fuliang Lu, Cláudio L. Lucchesi and Lianzhu Zhang

  • On the average degree of edge chromatic critical graphs
    J. Combin. Theory Ser. B, 147 (2021), 299-338
    with Yan Cao

  • The chromatic number of {ISK\(_4\), diamond, bowtie}-free graphs
    Journal of Graph Theory, 96 (2021), no. 4, 554-577
    with Yuan Chen, Qing Cui, Xing Feng, Qinghai Liu


  • On the average degree of edge chromatic critical graphs II
    J. Combin. Theory Ser. B, 145 (2020), 470-486
    with Yan Cao

  • Ring graphs and Goldberg's bound on chromatic index
    Journal of Graph Theory, 93 (2020), no. 3, 440-449
    with Yan Cao, Shushan He and Guangming Jing

  • Hamiltonicity of edge-chromatic critical graphs
    Discrete Math, 343 (2020), no. 7, 111881
    with Y. Cao, S. Jiang, H. Liu, and F. Lu

  • Spanning bipartite graphs with high degree sum in graphs
    Discrete Math, 343 (2020), no. 2, 111663
    with Shuya Chiba, Ronald Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, and Tomoki Yamashita

  • The chromatic number of graphs with no induced subdivision of \(K_4\)
    Graphs and Combinatorics, 36 (2020), 719-728
    with Yuan Chen, Qing Cui, Xing Feng, Qinghai Liu


  • Structural properties of edge-chromatic critical multigraphs
    Journal of Combinatorial Theory, Series B
    with Guangming Jing

  • Graph Edge Coloring: A Survey
    Graphs and Combinatorics
    with Yan Cao, Guangming Jing, Michael Stiebitz, Bjarne Toft

  • Disjoint odd cycles in cubic solid bricks
    SIAM Journal on Discrete Mathematics
    with Xing Feng, Fuliang Lu, Lianzhu Zhang

  • Average degrees of edge-chromatic critical graphs
    Discrete Mathematics
    with Yan Cao, Suyun Jiang, Huiqing Liu, Fuliang Lu


  • Cycles with a chord in dense graphs
    Discrete Mathematics
    with Ronald J. Gould, Xiaofeng Gu, Akira Saito

  • Chromatic index determined by fractional chromatic index
    J. Comb. Theory, Ser. B
    Yuping Gao, Ringi Kim, Luke Postle, Songling Shan


  • Vizing's \(2\)-Factor Conjecture Involving Large Maximum Degree
    Journal of Graph Theory
    with Songling Shan

  • Forbidden Pairs and the Existence of a Spanning Halin Subgraph
    Graphs and Combinatorics
    with Jie Han, Suil O, Songling Shan, Shoichi Tsuchiya

  • Equitable vertex arboricity of \(5\)-degenerate graphs
    J. Comb. Optim.
    with Yuping Gao, Songling Shan, Guanghui Wang, Jianliang Wu

  • Hamiltonicity of edge chromatic critical graphs
    Discrete Mathematics
    with Xiaodong Chen, Yue Zhao

  • Plane triangulations without a spanning Halin subgraph II
    SIAM Journal on Discrete Mathematics
    with Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya

  • Spanning Trails with Maximum Degree at Most \(4\) in \(2K_2\)-Free Graphs
    Graphs and Combinatorics
    with MN Ellingham, Akira Saito, Songling Shan

  • Nonempty Intersection of Longest Paths in Series-Parallel Graphs
    Discrete Mathematics
    with J. Ehrenmuller, C.G. Fernander, C. Heise, S. Shan, P. Yang, A. Yates


  • Bayesian Inference for Functional Dynamics Exploring in fMRI Data
    Computational and Mathematical Methods in Medicine
    with Xuan Guo, Bing Liu, Le Chen, Yi Pan and Jing Zhang


  • Plane triangulations without spanning Halin subgraphs: Counter examples of Lovász-Plummer conjecture on Halin graphs
    SIAM J. Discrete Math 29 (2015), no. 3, 1423-1426
    with H. Enomoto, K. Ozeki, and S. Tsuchiya

  • Characterizing forbidden pairs for hamiltonian squares
    Graphs Combin. 31 (2015), no. 6, 2113-2124
    with Songling Shan

  • Hadwiger's conjecture for degree sequences
    J. Combin. Theory Ser. B 114 (2015), 247-249
    with Katsuhiro Ota

  • Disjoint chorded cycles of the same length
    SIAM J. Discrete Math. 29 (2015), no. 2, 1030-1041
    with Ronald J. Gould, Kazuhide Hirohata, Katsuhiro Ota, and Songling Shan

  • An extension of the Chvatal-Erdős theorem: counting the number of maximum independent sets
    Graphs and Combinatorics 31 (2015), no. 4, 885-896
    with Yinkui Li, Haicheng Ma, Tingzeng Wu, and Liming Xiong


  • Degree conditions for spanning brooms
    J. Graph Theory, 77 (2014), no. 3, 237-250
    with Michael Ferrara, Zhiquan Hu, Michael Jacobson and Huiqing Liu

  • Maximum cuts for connected digraphs
    J. Graph Theory 76 (2014), no. 1, 1-19
    with Manzang Gu, and Nana Li

  • Spanning \(3\)-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
    Sci. China Math. 57 (2014), no. 8, 1579-1586
    with Yuan Chen and Zhiquan Hu


  • The existence of a \(2\)-factor in a graph satisfying the local Chv\(\acute{a}\)tal-Erd\(\ddot{o}\)s condition
    SIAM J. Discrete Math. 27 (2013), no. 4, 1788-1799
    with A. Saito and S. Shan

  • Homeomorphically Irreducible Spanning Trees
    J. Combin. Theory Ser. B 103 (2013), no. 4, 409-414
    with S. Shan


  • The circumference of a graph with no \(K_{3,t}\)-minor II
    J. Combin. Theory B, 102 (2012), no. 6, 1211-1240
    with X. Yu and W. Zang

  • Hamilton cycles will all small even chords
    Discrete Mathematics, 312 (2012), no. 6, 1226-1240
    with Katsuhiro Ota, Akira Saito, and Yi Zhao

  • Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
    Combinatorics, Probability, and Computing, 21 (2012), no. 1-2, 107-111
    with H. Ren and S. Shan

  • Forbidden pairs for \(k\)-connected Hamiltonian graphs
    Discrete Math., 312 (2012), no, 6, 1226-1240
    with Y. Egawa, R. Gould, A. Saito

  • Endpoint extendible paths in dense graphs
    Discrete Math, 312 (2012), no. 17, 2584-2592
    with Z. Hu and H. Li

  • Using a Resource Allocation Model to Better Guide Local Sexually Transmitted Diseases Control and Prevention Programs
    Operations Research for Health Care, 1 (2012), Issues 2-3, 23-29
    with Thomas Gift, Guoyu Tao, and Kun Zhao


  • Circumferences of \(k\)-connected Graphs Involving Independence Numbers
    J. Graph Theory, 68 (2011), no. 1, 55-76
    with Z. Hu and Y. Wu

  • Saturation numbers for families of Ramsey-minimal graphs
    Journal of Combin., 2 (2011), no. 3, 435-455
    with M. Ferrara, R. Gould, C. Magnant, J. Schmitt

  • Approximating the chromatic index of multigraphs
    J. Comb. Optim., 21 (2011), no. 2, 219-246
    with X. Yu and W. Zang

  • Toughness of \(K_{a,t}\)-minor-free graphs
    Electron. J. Combin., 18 (2011), no. 1, Paper 148, 6 pp
    with Y. Egawa, K. Kawarabayashi, B. Mohar, and K. Ota

  • Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks
    IEEE Transactions on Distributed Systems, 22(2011) no. 4, 695-703
    with Yingshu Li, Chinh Vu, Yi Zhao


  • Tournament score sequences with \(k\)-transitive \(m\)-partitionable realizations
    J. Graph Theory, 64 (2010), no. 1, 52-62
    with A. Busch and M. Jacobson

  • Path spectra for trees
    Discrete Math 310 (2010) 3455-3461
    with R. Faudree and L. Soltés

  • Optimization Model and Algorithm Help to Screen and Treat Sexually Transmitted Diseases
    Internat. J. Computational Models and Algorithms in Medicine, 1(2010), no. 4 1-18
    with T. Gift, G. Tao, and K. Zhao

  • A Universal Framework for Partial Coverage in Wireless Sensor Networks
    Performance Computing and Communications Conference, (IPCCC) 2009 IEEE 28th International, 1097-2641, 1-8
    with Y. Li, C. Vu, and Y. Zhao

  • Efficient Parallel Algorithms for Maximum-Density Segment Problem
    Parallel & Distributed Processing – the 24th IEEE International Symposium, 1530-2075, 1-9
    with F. Qiu, S. Prasad, and X. Wang

  • Integration of diverse research methods to analyze and engineer \(C_a^{2+}\)-binding proteins: From prediction to production
    Curent Bioinformatics, 5, no. 1 (2010) 68-80
    with M. Kirberger, S. Tang, X. Wang, J. Yang, K. Zhao

  • Analysis and prediction of calcium binding pockets from apo-protein structures exhibiting calcium-induced localized conformational changes
    Protein Science, 19, no. 6, (2010) 1180-1190
    with M. Kirberger, X. Wang, H. Wong, J. Yang


  • Towards Predicting C\(_a^{2+}\) –binding Sites with Different Coordination Numbers in Proteins with Atomic Resolution
    Proteins: Bioinformatics, 75 (2009), no. 4, 787-98
    with M. Kirberger, F. Qiu, X. Wang, and J. Yang

  • Toric geometry of series-parallel graphs
    SIAM J. Discrete Math, 23 (2009), no. 2, 754-64
    with J. Brennan


  • Linked graphs with restricted lengths
    J. Combin. Theory Ser. B, 98 (2008), no. 4, 735-751
    with Y. Chen, S. Gao, and Z. Hu

  • Gauss-{B}onnet formula, finiteness condition, and characterizations of graphs embedded in surfaces
    Graphs Combin., 24 (2008), no. 3, 159-183
    with B. Chen

  • Non-path spectrum sets
    J. Graph Theory, 58 (2008), no. 4, 329–350
    with R. Faudree, X. Li, and I. Schiermeyer

  • *Graphic sequences with a realization containing a complete multipartite subgraph
    Discrete Math, 308 (2008) 5712-21
    with M. Ferrara, R.J. Gould, J.R. Schmitt

  • Statistical Analysis of Structural Characteristics of Protein \(C_a^{2+}\) binding sites
    J. Biological Inorganic Chemistry, 30 (2008), no. 29, 9260-7
    with H. Deng, M. Kirberger, X. Wang, J. Yang, and W. Yang

  • Saturation Numbers of Books
    Electron. J. Combin., 15 (2008), no. 1, Research Paper 118, 12 pp.
    with R.J. Faudree and R.J. Gould


  • The neighborhood union of independent sets and hamiltonicity of graphs
    Discrete Math., 307 (2007), no. 17-18, 2226–2234
    with X. Li, Z. Wu, and X. Xu

  • Decomposition of bipartite graphs into special subgraphs
    Discrete Applied Mathematics, 155 (2007), no. 3, 400–404
    with R. Schelp

  • The Chvátal-Erdős condition and 2-Factors with a specified number of components
    Discussiones Mathematicae Graph Theory 27 (2007) no. 3, 401-407
    with R. Gould, K. Kawarabayashi, K. Ota, A. Saito, I. Schiermeyer


  • Cycle extendabilty of hamiltonian interval graphs
    SIAM J. Discrete Math., 20 (2006), no. 3, 682–689
    with R. Faudree, R. Gould, and M. Jacobson

  • Circumferences of graphs with no \(K_{3,t}\)-minors
    J. Combin. Ser B, Vol. 96 (2006), no. 6, 822-845
    with L. Sheppardson, X. Yu, and W. Zang

  • Predicting Calcium Binding Sites in Proteins-A Graph Theory and Geometry Approach
    Proteins: Structure, Function, and Bioinformatics 64 (2006) no. 1, 34–42
    with H. Deng, W. Yang, and J. Yang

  • Hamiltonian graphs involving neighborhood unions
    J. Graph Theory 53 (2006), no. 2, 83-100
    with W. Shreve and B. Wei

  • Approximating long cycles in graphs with bounded degrees
    SIAM J. Comput. 36 (2006), no. 3, 635–656
    with Z. Gao, W. Zang, and X. Yu

  • Characterizations of \([1,k]\)-Bar Visibility Trees
    Electron. J. Combin. 13 (2006), no. 1, Research Paper 90, 12 pp.
    with J.P. Hutchison, K. Keating, J. Shen

  • Cysteine separations profiles on protein secondary structure infer disulfide connectivity
    Proc. of IEEEGrC 2006 Atlanta, GA, May, 2006
    with H. Deng, Y. Gui, Y. Pan, and X. Wang


  • Graph minors and linkages
    J. of Graph Theory, 49 (2005), no. 1, 75–91.
    with R. Gould, K. Kawarabayashi, F. Pfender, B. Wei

  • Approximating the Longest Cycle Problem on Graphs with Bounded Degree
    Lecture Notes in Computer Science, Vol. 3595/2005, 870–884.
    with Z. Gao, X. Yu, and W. Zang


  • Re-screening women who test positive for C. trachomatis infection: an integer programming to determine numbers of women cured under fixed program budgets
    Health Care Management Science, 7 (2004), 135-144
    with G. Tao, B. Abban, and T. Gift

  • Circumference of graphs with bounded degree
    SIAM J. Comput. 33 (2004), no. 5, 1136-1170.
    with J. Xu and X. Yu

  • Vertex-disjoint cycles containing specified vertices in a bipartite graph
    J. of Graph Theory, 46 (2004), no. 3, 145-166.
    with H. Enomoto, K. Kawarabayashi, K. Ota, D. Lou, and A. Saito

  • Cycles in 4-connected planar graphs
    European J. Combin. 25 (2004), no. 6, 763-780.
    with G. Fan and X. Yu

  • New conditions for \(k\)-ordered Hamiltonian graphs
    Ars Combin., 70 (2004), 245-255.
    with G. Ronald and F. Pfender

  • An interlacing result on normalized laplacians
    SIAM J. Discrete Math. 18 (2004), no. 2, 353–361.
    with G. Davis, F. Hall, Z. Li, K. Patel, and M. Stewart

  • Linear forests and ordered cycles
    Discuss. Math. Graph Theory 24 (2004), no. 3, 359–372.
    with R. Faudree, R. Gould, M. Jacobson, L. Lesniak, and F. Pfender


  • Second neighborhood via first neighborhood in digraphs
    Ann Comb., 7 (2003), 15-20.
    with J. Shen and R. Yuster

  • Extremal graphs for intersecting cliques
    J. Combin. Theory Ser. B, 89 (2003), no. 2, 159-171.
    with R.J. Gould, Florian Pfender, and Bing Wei

  • Graph connectivity after path removal
    Combinatorica, 23 (2003), no. 2, 185-203.
    with R.J. Gould and X. Yu

  • On ranks of matrices associated with trees
    Graphs Combin., 19 (2003), no. 3, 323–334.
    with F. Hall, B. Wei, and Z. Li


  • A note on fragile graphs
    Discrete Math, 249 (2002), no. 1-3, 41-43.
    with X. Yu

  • The hamiltonicity of bipartite graphs involving neighborhood unions
    Discrete Math, 249 (2002), no. 1-3, 45-56
    with A. Saito, B. Wei, and X. Zhang

  • Long cycles in \(3\)-connected graphs
    J. Combin. Theory Ser. B, 86 (2002), no. 1, 80-99
    with X. Yu

  • Fragile graphs with small independent cuts
    J. Graph Theory, 41 (2002), no. 4, 327-341
    with R. Faudree and M. Jacobson


  • Partitioning vertices of a tournament into independent cycles
    J. Combin. Theory Ser. B, 83 (2001), no. 2, 213-220
    with R. Gould and H. Li

  • Degree-light-free graphs and Hamiltonian cycles
    Graphs Combin., 17 (2001), no. 3, 409–434
    with B. Wei and X. Zhang

  • Vertex-disjoint cycles containing specified edges in a bipartite graph
    Australas. J. Combin., 23 (2001), 37-48.
    with H. Enomoto, K. Kawarabayashi, K. Ota, D. Lou, and A. Saito

  • Degree sequences with repeated values
    Ars Combin., 59 (2001), 33-44.
    with J. Hutchinson, W. Piotrowski, W. Shreve, B. Wei

  • Weak clique-covering cycles and paths
    Ars Combin., 58 (2001), 67-83.
    with R. Faudree and W. Shreve

  • Isomorphisms involving reversing arcs of digraphs
    J. Combin. Math. Combin. Comput., 36 (2001), 155-160
    with F. Hall, A. Kezdy, Z. Li, and H. Zhou

  • On a relationship between \(2\)-dominating and \(5\)-dominating sets in graphs
    J. Combin. Math. Combin. Comput., 39 (2001), 139-145
    with M. Jacobson


  • Cliques covering the edges of a locally co-bipartite Graphs
    Discrete Math, 219 (2000), no. 1-3, 17-26
    with M. Jacobson, A. Kézdy, J. Lehel, E. Scheinerman, C. Wang

  • Hamiltonian connected graphs involving forbidden subgraphs
    Bull. Inst. Combin. Appl., 29 (2000), 25-32
    with R. Gould

  • Cycles in \(2\)-factors of balanced bipartite graphs
    Graphs Combin., 16 (2000), 67-80
    with R. Faudree, R. Gould, M. Jacobson, and L. Lesniak

  • \(2\)-factors in claw-free graphs
    Discuss. Math. Graph Theory, 20 (2000), no. 2, 165-172
    with J. Faudree, R. Gould, and A. Saito


  • On 2-factors containing 1-factors in bipartite graphs
    Discrete Math, 197-198 (1999), 185-194
    with R. Gould and M. Jacobson

  • On harmonious and related colorings of graphs
    Paul Erdős and his mathematics (Budapest, 1999), 50-53, János Bolyai Math. Soc., Budapest, 1999
    with G. Domke, J. Hattngh, R. Laskar

  • On the upper line-distinguishing and upper harmonious chromatic numbers of a graph
    Papers in honour of Stephen T. Hedetniemi, J. Combin. Math. Combin. Comput., 31 (1999), 227-239
    with G. Domke, J. Hattingh, and R. Laskar


  • Tough enough chordal graphs are hamiltonian
    Networks, 31 (1998), no. 1, 29-38
    with M. Jacobson, A. Kézdy, and J. Lehel

  • Intersection of longest cycles in \(k\)-connected graphs
    J. Combin. Theory Ser. B, 72 (1998), no. 1, 143-149.
    with R. Gould and R. Faudree

  • Mixed Ramsey numbers: total chromatic numbers versus stars
    Australas. J. Combin., 17 (1988), 157-168
    with N. Achuthan

  • Note on Whitney's theorem for \(k\)-connected graphs
    ARS Combin., 49 (1998), 33-40
    with R. Faudree and W. Warren

  • Star-factors of tournaments
    J. Graph Theory, 28 (1998), no. 3, 141-145
    with X. Lu and D. West

  • Note on graphs without repeated cycle lengths
    J. Graph Theory, 29 (1998), no. 1, 11-15
    with M. Jacobson, J. Lehel, and W. Shreve

  • Vertex colorings with a distance restriction
    Graph Theory (Elgersburg, 1996), Discrete Math, 191 (1998), 65-82
    with A. Gyárfárs and R. Schelp

  • Ramsey number for irregular graphs
    Congr. Numer., 135 (1998), 139-145
    with P. Erdős and W. Shreve


  • Graphs with given odd sets
    J. Graph Theory, 24 (1997), no. 1, 69-80.
    with R.H. Schelp, and L. Soltés

  • Special monochromatic trees in two-colored complete graphs
    J. Graph Theory, 24 (1997), no. 1, 59-67
    with R. Schelp, and L. Soltés

  • Degree conditions for \(2\)-factors
    J. Graph Theory, 24 (1997), no. 2, 165-173
    with S. Brandt, R. Faudree, R. Gould, and L. Lesniak

  • A new game chromatical numbers
    European J. Combin., 18 (1997), no. 1, 1-9,
    with R. Schelp and W. Shreve

  • A result on \(C_4\)-star Ramsey numbers
    Discrete Math, 163 (1997), no. 1-3, 243-246

  • A class of edge critical \(4\)-chromatic graphs
    Graphs Combin., (1997) 13, no. 2, 139-146
    with A. Gyárfárs and R. Schelp

  • A special \(k\)-coloring for a connected \(k\)-chromatic graph
    Discrete math, 170 (1997), no. 1-3, 231-236
    with R. Schelp and W. Shreve

  • Can One Load a Set of Dice So That the Sum Is Uniformly Distributed?
    Math. Mag., 70 (1997), no. 3, 204 -206
    with M. Rao and W. Shreve

  • Hamiltonian graphs with large neighborhood unions
    Ars Combin., 46 (1997), 227-238
    with Y. Liu

  • Degree sum conditions for hamiltonicity on \(K\)-partite graphs
    Graphs Combin., 13 (1997), 325-343
    with M. Jacobson


  • Proof of a conjecture of Bollobás on nested cycles
    J. Combin. Theory Ser. B, 66 (1996), no. 1, 38-43
    with P. Erdős and W. Staton

  • A partition approach to Vizing's conjecture
    J. Graph Theory, 21 (1996), no. 1, 103-111
    with W. Piotrawski and W. Shreve

  • Essential independent sets and hamiltonian cycles
    J. Graph Theory, 21 (1996), no. 2, 243-250
    with Y. Egawa, X. Liu, and A. Saito


  • The irredundant Ramsey number \(s(3,7)\)
    J. Graph Theory, 19 (1995), no. 2, 263-270
    with C. Rousseau

  • Vertex disjoint cycles for star free graphs
    Australas. J. Combin., 11 (1995), 157-167.
    with L. Markus and R. Schelp

  • Degree sequences with single repetitions
    Congr. Numer., 106 (1995), 27-32
    with W. Piotrawski and W. Shreve

  • Clique partitions of split graphs
    Combinatorics, graph theory, algorithms and applications (Beijing, 1993), 21-30, World Sci. Publ., River Edge, NJ, 1994
    with P. Erdős and Ordman

  • Hamiltonicity for \(K_{1,r}\)-free graphs
    J. Graph Theory, 20 (1995), no. 4, 423-439
    with R. Schelp

  • Hamiltonicity in balanced \(k\)-partite graphs
    Graphs Combin., 11(1995), 221-231
    with F. Faudree, R. Gould, M. Jacobson, and L. Lesniak


  • Graphs with a cycle of length divisible by three
    J. Combin. Theory Ser B 60 (1994), no. 2, 277-292
    with A. Saito

  • Hamiltonian graphs with neighborhood intersections
    J. Graph Theory, 18 (1994), no. 5, 497-513.
    with R. Schelp

  • Neighborhood unions and the cycle cover number of agraph
    J. Graph Theory 18 (1994), no. 7, 663-672.
    with R. Gould, M. Jacobson, and R. Schelp


  • Hamiltonian graphs involving neighborhood intersections
    Discrete Math, 112 (1993), no. 1-3, 253-257

  • Graphs with linear bounded Ramsey numbers
    J. Combin. Theory Ser. B, 57 (1993), 138-149
    with R. Schelp

  • A generalization of Fan's Condition for hamiltonicity, pancyclicity, and Hamiltonian connectedness
    Discrete Math, 115 (1993), no. 1-3, 39-50
    with P. Bedrossian and R. Schelp

  • Asymptotic bounds for irredundant and mixed Ramsey numbers
    J. Graph Theory, 17 (1993), 193-206.
    with J. Hattingh and C. Rousseau

  • Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
    European J. Combin., 14 (1993), no. 3, 183-189.
    with P. Erdős, C. Rousseau, and R. Schelp

  • Ramsey problems with bounded degree spread
    Combin. Probab. Comput., 2 (1993), 263-269.
    with R. Schelp

  • Graphs with cycles 2 mod k
    Congr. Numer., 93 (1993), 177-182.
    with N. Dean and W. Shreve


  • Hamiltonian graphs involving distances
    J. Graph Theory 16 (1992), no. 2, 121-129
    with R. Schelp

  • On \(k\)-girth graphs
    Congr. Numer., 89 (1992), 193-207
    with R. Schelp and W. Shreve

  • A characterization of influence graphs of a prescribed graph
    Vishwa Internat. J. Graph Theory, 1 (1992), no. 1, 77-81.
    with R. Gould, M. Jacobson, R. Schelp, and D. West


  • A degree condition for hamiltonian cycles in t-tough graphs with \(t >1\)
    Advances in Graph Theory, 19-32, Vishwa, Gulbarga, 1991
    with D. Bauer and L. Lasser


  • One sufficient condition for hamiltonian graphs
    J. Graph Theory, 14 (1990), no. 4, 501-508.