| Publication | Date of Publication | Type |
|---|
| The \(p\)-arboricity of outerplanar graphs | 2025-01-13 | Paper |
| The decycling number of a line graph | 2024-12-02 | Paper |
| Upper bounds on the chromatic polynomial of a connected graph with fixed clique number | 2023-05-26 | Paper |
| The number of copies of \(K_{2,t+1}\) in a graph | 2022-08-18 | Paper |
| Nonseparating independent sets and maximum genus of graphs | 2022-07-15 | Paper |
| The number of 4-cycles in a graph | 2022-06-03 | Paper |
| Dynamical analysis of border collision bifurcation in one-cycle controlled single-inductor dual-output boost DC-DC converters | 2022-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5062582 | 2022-03-17 | Paper |
| Mean color numbers of some graphs | 2022-01-03 | Paper |
| Distributions of near-4-regular maps on the sphere and the projective plane | 2021-11-30 | Paper |
| Upper bounds for the independence polynomial of graphs at \(-1\) | 2021-08-24 | Paper |
| Classification and recursive method for perfect matching number of two kinds of special graphs | 2021-07-01 | Paper |
| Enumeration of perfect matchings of a type of 3-regular graphs | 2021-01-14 | Paper |
| Perfect matching counts for \(2\)-\(2n{P_5}\) and \(2\)-\(n{K_{1,1,1,3}}\) graphs | 2021-01-14 | Paper |
| A new cycle structure theorem for Hamiltonian graphs | 2021-01-14 | Paper |
| Recursive method for perfect matching number in two types of graphs | 2020-10-27 | Paper |
| The nested recursive method of analytic formula of the number of perfect matchings for two types of graphs | 2020-10-27 | Paper |
| Perfect matching number of two kinds of graphs based on recursive method of matching vertex classification | 2020-10-27 | Paper |
| A recursive method for perfect matching number classified with saturation of a certain vertex | 2020-08-12 | Paper |
| Recursive method for the number of 1-factors in graphs | 2020-08-12 | Paper |
| The perfect matching number of three types of graphs based on the recursive method of matching a certain vertex classification | 2020-08-12 | Paper |
| 4-edge-connected 4-regular maps on the projective plane | 2020-07-21 | Paper |
| Nonseparating independent sets of Cartesian product graphs | 2020-02-28 | Paper |
| The orientable genus of the join of a cycle and a complete graph | 2020-02-21 | Paper |
| A note on decycling number and vertex-arboricity of cubic graphs | 2020-01-22 | Paper |
| Recursive method for perfect matching numbers by matching vertex classification | 2020-01-22 | Paper |
| Recurrence calculation of the perfect matchings number of two types of graphs | 2020-01-22 | Paper |
| The number of ordered splits where the components of a positive integer n are not less than 2 | 2020-01-22 | Paper |
| Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs | 2020-01-08 | Paper |
| Maximum genus and independent set. | 2019-12-18 | Paper |
| New formulae for the bipartite vertex frustration and decycling number of graphs | 2019-11-26 | Paper |
| Extending colorings of planar graphs | 2019-11-06 | Paper |
| Classification and recursive method for 1-factor number of two kinds of special graphs | 2019-09-20 | Paper |
| Odd components of co-trees and graph embeddings | 2019-03-21 | Paper |
| Finding a shortest cycle in a subspace of the cycle space of a graph | 2019-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4623656 | 2019-02-22 | Paper |
| The lower bound for the number of 1-factors in generalized Petersen graphs | 2019-01-24 | Paper |
| Bounds for judicious balanced bipartitions of graphs | 2019-01-11 | Paper |
| A note on decycling number, vertex partition and AVD-total coloring in graphs | 2019-01-11 | Paper |
| New formulae for the decycling number of graphs | 2018-12-05 | Paper |
| Decycling number of a class of 4-regular graphs. | 2018-09-20 | Paper |
| The decycling number and maximum genus of cubic graphs | 2018-08-16 | Paper |
| The graceful labeling of two kinds of graphs and their coronas | 2018-07-18 | Paper |
| The counting formula of the perfect matchings of three types of special graphs | 2018-05-25 | Paper |
| The number of perfect matchings of two types of particular graphs | 2018-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3131408 | 2018-01-29 | Paper |
| The orientable genus of the generalized Petersen graph \(P(km,m)\). | 2017-12-15 | Paper |
| Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) | 2017-12-12 | Paper |
| Counting formulas for the number of perfect matchings of three types of graphs | 2017-10-20 | Paper |
| The decycling number of graphs \({G_{n{K_4}}}\) | 2017-10-20 | Paper |
| A new formula for the decycling number of regular graphs | 2017-09-18 | Paper |
| The analytic formula of the number of perfect matchings of two types of graphs | 2017-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5276984 | 2017-07-14 | Paper |
| The decycling number and vertex coloring of Halin graphs | 2017-07-14 | Paper |
| The number of \(1\)-factors and edge-colorings of Möbius ladder graphs and triangular embeddings of \(K_{12m+7}\). | 2017-04-21 | Paper |
| The graceful labeling of two types graphs is constituted by cycles of length four | 2017-01-06 | Paper |
| Counting formulas of perfect matchings of two types of graphs | 2017-01-06 | Paper |
| Decycling number and graph embeddings | 2017-01-06 | Paper |
| Minimum genus embeddings of the complete graph | 2016-11-02 | Paper |
| Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints. | 2016-10-26 | Paper |
| \(\mathrm L(2,1)\)-labeling of a circular graph. | 2016-10-26 | Paper |
| The number of perfect matchings in two types of 3-regular graphs | 2016-10-06 | Paper |
| Graceful labeling of the corona for two kinds of graceful graphs | 2016-08-10 | Paper |
| A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface | 2016-07-22 | Paper |
| The cycle's structure of embedded graphs in surfaces | 2016-05-04 | Paper |
| A note on graph proper total colorings with many distinguishing constraints | 2016-04-06 | Paper |
| Finding shorter cycles in a weighted graph | 2016-03-02 | Paper |
| Exponentially many genus embeddings of the complete graph \(K_{12s+3}\) | 2015-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5260052 | 2015-06-29 | Paper |
| Chromatic properties of 6-regular graphs embedded on the Klein bottle | 2015-06-29 | Paper |
| Vertex splitting and upper embeddable graphs | 2015-06-29 | Paper |
| The numbers of perfect matching in three types of 3-regular graphs | 2015-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5260614 | 2015-06-29 | Paper |
| The enumeration of perfect matchings in two types of graphs | 2014-11-03 | Paper |
| Estimating the number of short cycles in a simple planar graph | 2014-11-03 | Paper |
| Four types of nested recursive methods for finding graph perfect matching numbers | 2014-11-03 | Paper |
| Counting 2-connected 4-regular maps on the projective plane | 2014-09-04 | Paper |
| A recursive method for finding the number of perfect matchings of two types of graphs | 2014-06-30 | Paper |
| The analytic formulas of the number of perfect matchings for four types of graphs | 2014-06-30 | Paper |
| Lower bound on the number of the maximum genus embedding of \(K_{n,n}\) | 2014-02-19 | Paper |
| Maximum genus embeddings and genus embeddings on orientable surfaces | 2014-02-19 | Paper |
| The nonorientable genus of the join of two cycles | 2013-12-05 | Paper |
| Space theory on graphs: the linearly independence methods in graph theory. I | 2013-11-19 | Paper |
| Space theory on graphs: the linearly independence methods in graph theory. II | 2013-11-19 | Paper |
| The number of perfect matchings in four types of particular graphs | 2013-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4925979 | 2013-06-20 | Paper |
| The number of perfect matchings in five types of graphs | 2013-06-20 | Paper |
| Counting formulas of the number of perfect matchings for four types of graphs | 2013-06-20 | Paper |
| Generating minimal forbidden subgraphs for a non-orientable surface | 2013-06-20 | Paper |
| The number of perfect matchings in three types of graphs | 2013-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4901058 | 2013-01-24 | Paper |
| The number of perfect matchings in six types of graphs | 2013-01-24 | Paper |
| Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) | 2012-12-27 | Paper |
| The number of the perfect matchings for three specific types of graphs | 2012-10-05 | Paper |
| The crossing numbers of two-maps on orientable surfaces | 2012-06-01 | Paper |
| Homeomorphically irreducible spanning trees in locally connected graphs | 2012-05-14 | Paper |
| The extremal genus embedding of graphs | 2012-03-05 | Paper |
| Maximum genus and minimum genus embedding in non-orientable surfaces | 2012-01-27 | Paper |
| A generating algorithm for all graceful labelings of graceful graphs | 2012-01-27 | Paper |
| Genus of \(C_{m,n}\) and strong genus embedding of \(K_{m,n}\) | 2012-01-27 | Paper |
| Locally connectivity and up-embeddability of a graph | 2012-01-27 | Paper |
| Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) | 2012-01-24 | Paper |
| A nonconvex nonorientable crossing number sequence | 2011-09-29 | Paper |
| Weighted graphs permitting no LEW-embeddings | 2011-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3170050 | 2011-09-29 | Paper |
| Survey of maximum genus of graphs | 2011-09-29 | Paper |
| Enumeration of closed families of finite sets | 2011-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3017172 | 2011-07-19 | Paper |
| The projective plane crossing numbers of circular graphs | 2010-12-14 | Paper |
| Enumerative properties of rooted circuit maps | 2010-11-12 | Paper |
| Finding short cycles in embedded graph in polynomial time | 2010-06-23 | Paper |
| Shortest co-cycle bases of graphs | 2010-05-25 | Paper |
| Flexibility of embeddings of a Halin graph in the torus | 2010-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3405221 | 2010-02-12 | Paper |
| Crossing number of simultaneous embedding of two planar graphs with restriction | 2010-02-12 | Paper |
| Fundamental cycles and graph embeddings | 2009-12-11 | Paper |
| Exponentially many maximum genus embeddings and genus embeddings for complete graphs | 2009-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3640720 | 2009-11-11 | Paper |
| Structures of facial cycles and \(C\)-bridges of embedded graphs with locally LEW-embedding properties | 2009-11-11 | Paper |
| Minor and minimum cycle bases of a 3-connected planar graph | 2009-11-11 | Paper |
| Unicyclic subgraphs in 2-connected graphs | 2009-11-11 | Paper |
| Ford-Fulkerson algorithm and short cycles in embedded graphs | 2009-07-22 | Paper |
| Short cycle structure of graphs on surfaces. I: The uniqueness theorems | 2008-10-27 | Paper |
| Embeddings of circular graphs | 2008-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3515632 | 2008-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5453925 | 2008-04-03 | Paper |
| Structures of cycle bases with some extremal properties | 2008-04-03 | Paper |
| Minimum cycle bases of graphs on surfaces | 2007-11-27 | Paper |
| Distributions of near-4-regular maps on the plane and the projective plane | 2007-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5293449 | 2007-07-02 | Paper |
| Upper embeddability of 3-edge-connected simple graphs with independence number \(\leq 5\) | 2007-01-19 | Paper |
| Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen | 2006-12-06 | Paper |
| An interpolation theorem for near-triangulations | 2006-10-04 | Paper |
| Counting nonseparable near-triangulations on the projective plane | 2006-09-11 | Paper |
| Near-triangular embeddings for triangulations of the sphere and the torus. I | 2006-08-09 | Paper |
| Upper-embeddability of a graph \(G^3\) | 2006-02-07 | Paper |
| Cycle base structure of outerplanar graphs | 2006-01-26 | Paper |
| The crossing number of the circular graph \(C(2m+2,m)\) | 2005-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5698594 | 2005-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4672591 | 2005-05-03 | Paper |
| Cycle spaces of graphs on the sphere and the projective plane | 2005-04-29 | Paper |
| Bisingular maps on some surfaces | 2005-01-31 | Paper |
| Maximum genus of strong embeddings | 2004-06-22 | Paper |
| Enumeration of 2-connected loopless 4-regular maps on the plane | 2003-02-11 | Paper |
| 4-regular maps on the Klein bottle | 2002-12-10 | Paper |
| The number of loopless \(4\)-regular maps on the projective plane | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154085 | 2002-11-14 | Paper |
| Enumeration of simple bipartite maps on the sphere and the projective plane | 2002-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549006 | 2002-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549092 | 2002-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542664 | 2002-08-25 | Paper |
| Enumerating near-4-regular maps on the sphere and the torus | 2002-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761534 | 2001-09-18 | Paper |
| Bisingular maps on the sphere and the projective plane | 2001-07-23 | Paper |
| An improvement of Faudree-Schelp theorem on path-connected graphs. | 2001-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504840 | 2000-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504856 | 2000-09-14 | Paper |
| On the number of fair triangulations | 2000-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937817 | 2000-06-09 | Paper |
| Counting rooted near-4-regular Eulerian maps on some surfaces | 1999-11-23 | Paper |
| Enumeration of rooted planar Halin maps | 1999-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840557 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4305527 | 1995-07-11 | Paper |
