[48<\/small>]\u00a0The Clique Number of Graphs Covered by Long Cycles<\/a>\u00a0(with N. Ji), SIAM Journal on Discrete Mathematics, 37 (2) (2023) 917–924..[47]\u00a0<\/small>Resonance Graphs on Perfect Matchings of Graphs on Surfaces\u00a0<\/a>(with N. Tratnik), Graphs and Combinatorics, 39 (4) (2023) 68: 15pp.[46] \u00a0Minimal Quadrangulations of Surfaces<\/a>\u00a0(with\u00a0M.N. Elligham<\/a>\u00a0and W. Liu),\u00a0Journal of Combinatorial Theory Ser B, 157 (2022) 235–262.[45]\u00a0Connectivity for Kite-linked Graphs\u00a0<\/a>(with R. Liu, M. Rolek, Chris Stephens and G. Yu), SIAM Journal on Discrete Mathematics, 35 (1) (2021) 431–446. Publications [48]\u00a0The Clique Number of Graphs Covered by Long Cycles\u00a0(with N. Ji), SIAM Journal on Discrete Mathematics, 37 (2) (2023) 917–924..[47]\u00a0Resonance Graphs on Perfect Matchings of Graphs on Surfaces\u00a0(with N. Tratnik), Graphs and Combinatorics, 39 (4) (2023) 68: 15pp.[46] \u00a0Minimal Quadrangulations of Surfaces\u00a0(with\u00a0M.N. Elligham\u00a0and W. Liu),\u00a0Journal of Combinatorial Theory Ser B, 157 (2022) 235–262.[45]\u00a0Connectivity for […]<\/p>\n","protected":false},"author":10,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-12","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/people.mtsu.edu\/dongye\/wp-json\/wp\/v2\/pages\/12","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.mtsu.edu\/dongye\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/people.mtsu.edu\/dongye\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/people.mtsu.edu\/dongye\/wp-json\/wp\/v2\/users\/10"}],"replies":[{"embeddable":true,"href":"https:\/\/people.mtsu.edu\/dongye\/wp-json\/wp\/v2\/comments?post=12"}],"version-history":[{"count":1,"href":"https:\/\/people.mtsu.edu\/dongye\/wp-json\/wp\/v2\/pages\/12\/revisions"}],"predecessor-version":[{"id":260,"href":"https:\/\/people.mtsu.edu\/dongye\/wp-json\/wp\/v2\/pages\/12\/revisions\/260"}],"wp:attachment":[{"href":"https:\/\/people.mtsu.edu\/dongye\/wp-json\/wp\/v2\/media?parent=12"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
[44]\u00a0Toughness and Spanning Trees in K4-minor-free graphs<\/a>\u00a0(with\u00a0M.N. Ellingham<\/a>,\u00a0S. Shan<\/a>\u00a0and\u00a0X. Zha<\/a>), Journal of Graph Theory, 96 (3) (2021) 379–402.
[43]\u00a0Cycle Traversability for Claw-free Graphs and Polyhedral Maps<\/a>\u00a0(with\u00a0E. Gy\u0151ri<\/a>,\u00a0M.D. Plummer\u00a0and\u00a0X. Zha<\/a>), Combinatorica, 40 (3) (2020) 405–433.
[42]\u00a0Minimum T-Joins and Signed-Circuit Covering\u00a0<\/a>(with Y. Wu), SIAM Journal on Discrete Mathematics, 34 (2) (2020) 1192–1204.
[41]\u00a0Dominating Maximal Outerplane Graphs and Hamiltonian Plane Triangulations<\/a>\u00a0(with\u00a0M.D. Plummer\u00a0and\u00a0X. Zha<\/a>), Discrete Applied Mathematics, 282 (2020) 162–167.
[40]\u00a0Edge-coloring of signed graphs<\/a>\u00a0(with Y. Lu, R. Luo, L. Zhang and S. Zhang), Discrete Applied Mathematics, 282 (2020) 234–242.
[39]\u00a0Quadrangular Embeddings of Complete Graphs and the Even Map Color Theorem\u00a0<\/a>(with W. Liu, S. Lawrencenko, B. Chen,\u00a0M. Ellingham<\/a>, N. Hartsfield, H. Yang and\u00a0X. Zha<\/a>), Journal of Combinatorial Theory Ser. B, 139 (2019) 1–26.
[38]\u00a0Homeomorphically Irreducible Spanning Trees in Hexangulations of Surfaces<\/a>\u00a0(with J. He, E. Wei, S. Zhai), Discrete Mathematics, 342 (2019) 2893–2899.
[37]\u00a0On Perfect Matchings in Matching Covered Graphs<\/a>\u00a0(with J. He, E. Wei, S. Zhai), Journal of Graph Theory, 90 (4) (2019) 535–546.
[36]\u00a0On the Anti-Kekul\u00e9 Problem of Cubic Graphs<\/a>\u00a0(with Q. Li,\u00a0W.-C. Shiu<\/a>, P.-K. Sun), The Art of Discrete and Applied Mathematics, 2 (2019) P1.05: 1–11.
[35]\u00a0Inverses of Bipartite Graphs\u00a0<\/a>(with Y. Yang), Combinatorica, 38 (5) (2018) 1251–1263.
[34]\u00a0Circuit Covers of Cubic Signed Graphs\u00a0<\/a>(with Y. Wu), Journal of Graph Theory, 89 (1) (2018) 40–54.
[33]\u00a0Maximum Matchings in Regular Graphs<\/a>, Discrete Mathematics, 341 (5) (2018) 1195–1198.
[32]\u00a0Circuit Decomposition and Shortest Circuit Cover of Hypergraphs\u00a0<\/a>(with L. Kang, W. Lu, Y. Wu and\u00a0C.-Q. Zhang<\/a>), Graphs and Combinatorics, 34 (2) (2018) 365–372.
[31]\u00a0Clar Structures vs Fries Structrues in Hexagonal Systems\u00a0<\/a>(with D. Alrowaili and S. Zhai), Applied Mathematics and Computation, 329 (2018), 384–394.
[30]\u00a0A Note on Median Eigenvalues of Bipartite Graphs\u00a0<\/a>(with Y. Wu and Y. Yang), Communications in Mathematical and in Computer Chemistry, 80(3) (2018) 853–862.
[29]\u00a0Connectivity and Wv-paths in Polyhedral Maps on Surfaces<\/a>\u00a0(with\u00a0M.D. Plummer\u00a0and\u00a0X. Zha<\/a>), Discrete & Computational Geometry, 58 (1) (2017) 217–231.
[28]\u00a0Cycle Double Covers and Long Circuits of Graphs<\/a>\u00a0(with\u00a0X. Wang<\/a>\u00a0and\u00a0R. Xu<\/a>), Journal of Combinatorics, 8 (2) (2017) 341–347.
[27]\u00a0On 2-Cores of Resonance Graphs of Fullerenes<\/a>\u00a0(with T. Do\u0161li\u0107, N. Tratnik and P. \u017digert Pleter\u0161ek), Communications in Mathematical and in Computer Chemistry, 77 (3) (2017) 729–736.
[26]\u00a0Graph Invertibility and Median Eigenvalues<\/a>\u00a0(with\u00a0D.J. Klein<\/a>, B. Mandal and Y. Yang), Linear Algebra and its Applications, 513 (2017) 304–323.
[25]\u00a0Uniquely Forced Perfect Matching and Unique 3-Edge-Coloring<\/a>\u00a0(with Y. Wu and\u00a0C.-Q. Zhang<\/a>), Discrete Applied Mathematics, 215 (2016) 203–207.
[24]\u00a0Decomposing Plane Cubic Graphs<\/a>\u00a0(with\u00a0K. Ozeki<\/a>), European Journal of Combinatorics, 52 (2016) 40–46.
[23]\u00a0Dominating Plane Triangulations<\/a>\u00a0(with\u00a0M.D. Plummer\u00a0and\u00a0X. Zha<\/a>), Discrete Applied Mathematics, 211 (2016) 175–182.
[22]\u00a0Matching Extension in Toroidal Quadrangulations II: the 3-Extendable Case<\/a>\u00a0(with\u00a0R. Aldred<\/a>, Q. Li,\u00a0M.D. Plummer\u00a0and H. Zhang), Australasian Journal of Combinatorics, 63(2) (2015) 268–296.
[21]\u00a0HUMO-LUMO Gaps for Sub-graphenic and Sub-buckytubic Species<\/a>\u00a0(with\u00a0D.J. Klein<\/a>\u00a0and Y. Yang), Proceedings of the Royal Society A, 471 (2180) (2015) 20150138.
[20]\u00a0Nowhere-zero 3-Flows in Signed Graphs<\/a>\u00a0(with Y. Wu,\u00a0W. Zang<\/a>\u00a0and\u00a0C.-Q. Zhang<\/a>), SIAM Journal on Discrete Mathematics, 28 (3) (2014) 1628–1637.
[19]\u00a0Face-width of Pfaffian Braces and Polyhex Graphs on Surfaces<\/a>\u00a0(H. Zhang), Electronic Journal of Combinatorics, 24 (4) (2014) P4.37: 1–19.
[18]\u00a0Packing Resonant Hexagons in Fullerenes<\/a>\u00a0(with\u00a0J. Carr\u00a0and\u00a0X. Wang<\/a>), Discrete Optimization, 13 (2014) 49–54.
[17]\u00a0A Note on an Extremal Problem for Group-Connectivity<\/a>\u00a0(with R. Luo, Y. Wu and\u00a0C.-Q. Zhang<\/a>), European Journal of Combinatorics, 40 (2014) 137–141.
[16]\u00a0Nowhere-zero 15-Flows in 3-Connected Bidirected Graphs<\/a>\u00a0(with W. Tang and E. Wei), Acta Mathematica Sinica, 30 (4) (2014) 646–660.
[15]\u00a0On the Anti-Kekul\u00e9 Number and Odd Cycle Transversal of Regular Graphs<\/a>, Discrete Applied Mathematics, 161 (13\/14) (2013) 2196–2199.
[14]\u00a0Circuit Extension and Circuit Double Cover of Graphs<\/a>\u00a0(with Z. Miao and\u00a0C.-Q. Zhang<\/a>), Discrete Mathematics, 313 (20) (2013) 2055–2060.
[13] Hamilton Cycles in Cubic Polyhex Graphs on the Klein Bottle, Ars Combinatoria, 112 (2013) 205–212.
[12]\u00a0Cycle Double Covers and Semi-Kotzig Frame<\/a>\u00a0(with\u00a0C.-Q. Zhang<\/a>), European Journal of Combinatorics, 33 (4) (2012) 624–631.
[11]\u00a0On the Anti-Kekul\u00e9 Number of Fullerenes<\/a>\u00a0(with\u00a0Y. Lin<\/a>, Q. Yang and H. Zhang), Communications in Mathematical and in Computer Chemistry, 67 (2) (2012) 281–288.
[10]\u00a0A Combination of Clar Number and Kekul\u00e9 Count as an Indicator of Relative Stability of Fullerene Isomers of C60<\/a>\u00a0(with Y. Liu and H. Zhang), Journal of Mathematical Chemistry, 48 (3) (2010) 733–740.
[09]\u00a0Forcing Matching Numbers of Fullerene Graphs<\/a>\u00a0(with\u00a0W.-C. Shiu<\/a>\u00a0and H. Zhang), Discrete Applied Mathematics, 158 (5) (2010) 573–582.
[08]\u00a0Extremal Fullerene Graphs with the Maximum Clar Number<\/a>\u00a0(with H. Zhang), Discrete Applied Mathematics, 157 (14) (2009) 3152–3173.
[07]\u00a0On k-Resonant Fullerene Graphs<\/a>\u00a0(with Z. Qi and H. Zhang), SIAM Journal on Discrete Mathematics, 23 (2) (2009) 1023–1044.
[06]\u00a02-Extendability of Toroidal Polyhexes and Klein-bottle Polyhexes<\/a>\u00a0(with H. Zhang), Discrete Applied Mathematics, 157 (2) (2009) 292–299.
[05] The Relation between Cyclic-edge-connectivity and Cylic-connectivity of 3-Regular Connected Graphs (with Z. Qi and H. Zhang) , Journal of Shangdong University, 44 (12) (2009) 22–24.
[04]\u00a0k-Resonant Toroidal Polyhexes<\/a>\u00a0(with H. Zhang), Journal of Mathematical Chemistry,44 (1)(2008) 270–285.
[03]\u00a0The Forcing Number of Toroidal Polyhexes<\/a>\u00a0(with H. Wang and H. Zhang), Journal of Mathematical Chemistry, 43 (2) (2008) 457–475.
[02]\u00a0Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs<\/a>\u00a0(with\u00a0J. Huang<\/a>), Lecture Notes in Computer Science, 4489 (2007) 353–361
[01]\u00a0An Upper Bound for the Clar Number of Fullerene Graphs<\/a>\u00a0(with H. Zhang), Journal of Mathematical Chemistry, 41 (2) (2007)123–133.
Submitted Papers:
[1] Orientable qudrilaterial embeddings of cartesian products of graphs (with\u00a0M.N. Ellingham<\/a>, W. Liu and X. Zha).
[2] On sign-invertible graphs (with I. Osborne).\u00a0[3] Integer flow and sign-circuit covering (with J. Li and Y. Wu).\u00a0<\/p>\n","protected":false},"excerpt":{"rendered":"