| Publication | Date of Publication | Type |
|---|
| On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree | 2024-09-16 | Paper |
| Partial-dual polynomial as a framed weight system | 2024-08-21 | Paper |
| The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions | 2024-08-19 | Paper |
| A new note on 1-planar graphs with minimum degree 7 | 2024-03-27 | Paper |
| Introduction to Graph Theory | 2023-11-08 | Paper |
| Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II | 2023-10-30 | Paper |
| DP color functions versus chromatic polynomials (II) | 2023-10-10 | Paper |
| ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ | 2023-10-10 | Paper |
| On the colorability of bi-hypergraphs | 2023-10-10 | Paper |
| Zip product of graphs and crossing numbers | 2023-09-29 | Paper |
| On the maximum local mean order of sub-k-trees of a k-tree | 2023-09-21 | Paper |
| The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions | 2023-05-06 | Paper |
| Compare list-color functions of hypergraphs with their chromatic polynomials (I) | 2023-05-03 | Paper |
| An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) | 2023-05-02 | Paper |
| Foundations of the chromatic polynomial | 2023-04-28 | Paper |
| On the Size of Matchings in 1-Planar Graph with High Minimum Degree | 2022-11-09 | Paper |
| Proving identities on weight polynomials of tiered trees via Tutte polynomials | 2022-10-14 | Paper |
| New upper bounds for the crossing numbers of crossing-critical graphs | 2022-09-26 | Paper |
| Anti-Ramsey numbers for trees in complete multi-partite graphs | 2022-09-26 | Paper |
| DP color functions versus chromatic polynomials | 2022-01-21 | Paper |
| Problems on chromatic polynomials of hypergraphs | 2021-09-06 | Paper |
| The maximal 1-planarity and crossing numbers of graphs | 2021-07-28 | Paper |
| $Z_{DP}(n)$ is upperly bounded by $n^2-(n+3)/2$ | 2021-07-19 | Paper |
| Express the number of spanning trees in term of degrees | 2021-06-15 | Paper |
| On the sizes of bipartite 1-planar graphs | 2021-06-07 | Paper |
| Properties of \(\pi\)-skew graphs with applications | 2021-05-11 | Paper |
| Zero-free intervals of chromatic polynomials of hypergraphs | 2020-10-08 | Paper |
| A survey on the study of real zeros of flow polynomials | 2020-07-17 | Paper |
| Polynomials related to chromatic polynomials | 2020-07-10 | Paper |
| New expressions for order polynomials and chromatic polynomials | 2020-05-21 | Paper |
| The rank of a complex unit gain graph in terms of the matching number | 2020-04-21 | Paper |
| On the skewness of Cartesian products with trees | 2019-09-05 | Paper |
| Formulas counting spanning trees in line graphs and their extensions | 2019-07-17 | Paper |
| From G-parking functions to B-parking functions | 2018-09-07 | Paper |
| On graphs whose flow polynomials have real roots only | 2018-08-15 | Paper |
| A study on rank commutators of special families of matrices | 2018-07-18 | Paper |
| Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4 | 2018-05-25 | Paper |
| A note on distance spectral radius of trees | 2018-02-16 | Paper |
| On the largest outscribed equilateral triangle | 2017-09-01 | Paper |
| Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs | 2017-06-30 | Paper |
| Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs | 2017-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3462420 | 2016-01-14 | Paper |
| Zeros of Jones polynomials of graphs | 2015-08-27 | Paper |
| Graph Theory | 2015-04-07 | Paper |
| The chromatic equivalence class of \(K_{1, n, n + 2}\) | 2015-01-30 | Paper |
| The effect of a graft transformation on distance spectral radius | 2014-07-21 | Paper |
| A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set | 2014-01-03 | Paper |
| On the number of perfect matchings of line graphs | 2013-04-18 | Paper |
| The 3-connectivity of a graph and the multiplicity of zero ``2 of its chromatic polynomial | 2012-07-10 | Paper |
| A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs | 2012-03-15 | Paper |
| On atom-bond connectivity index of connected graphs | 2011-10-27 | Paper |
| On Zero-Free Intervals in $(1,2)$ of Chromatic Polynomials of Some Families of Graphs | 2011-04-15 | Paper |
| Zeros of the Jones polynomial are dense in the complex plane | 2010-08-12 | Paper |
| On graphs determining links with maximal number of components via medial construction | 2010-04-28 | Paper |
| DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES | 2010-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5851396 | 2010-01-21 | Paper |
| Bounds For The Real Zeros of Chromatic Polynomials | 2009-03-04 | Paper |
| Domination numbers and zeros of chromatic polynomials | 2008-11-12 | Paper |
| The maximum number of maximal independent sets in unicyclic connected graphs | 2008-07-11 | Paper |
| On planar and non-planar graphs having no chromatic zeros in the interval(1,2) | 2008-07-11 | Paper |
| A maximal zero-free interval for chromatic polynomials of bipartite planar graphs | 2008-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5386171 | 2008-04-21 | Paper |
| On Graphs Having No Chromatic Zeros in (1,2) | 2007-09-06 | Paper |
| Bounds for the coefficients of flow polynomials | 2007-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5313291 | 2005-08-26 | Paper |
| Two Results on Real Zeros of Chromatic Polynomials | 2005-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820523 | 2004-10-15 | Paper |
| On upper bounds for real roots of chromatic polynomials | 2004-08-06 | Paper |
| Chromatically unique multibridge graphs | 2004-02-05 | Paper |
| Divisibility of certain coefficients of the chromatic polynomials. | 2004-02-02 | Paper |
| Chromaticity of some families of dense graphs | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529518 | 2002-09-20 | Paper |
| The vertex-cover polynomial of a graph | 2002-08-29 | Paper |
| Structures and chromaticity of extremal 3-colourable sparse graphs | 2002-07-14 | Paper |
| Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529520 | 2002-06-10 | Paper |
| Non-chordal graphs having integral-root chromatic polynomials. II | 2002-05-15 | Paper |
| A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs | 2002-03-13 | Paper |
| Some inequalities on chromatic polynomials | 2002-03-13 | Paper |
| Chromatically unique bipartite graphs with low 3-independent partition numbers | 2001-06-28 | Paper |
| An attempt to classify bipartite graphs by chromatic polynomials | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495689 | 2000-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944827 | 2000-03-22 | Paper |
| Structures and chromaticity of some extremal 3-colourable graphs | 2000-03-13 | Paper |
| On the structure and chromaticity of graphs in which any two colour classes induce a tree | 1998-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4379744 | 1998-03-04 | Paper |
| On graphs in which any pair of colour classes but one induces a tree | 1997-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4717030 | 1997-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4346040 | 1997-07-28 | Paper |
| On the chromatic uniqueness of the graph \(W(n,n-2,k)\) | 1996-10-13 | Paper |
| On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\) | 1996-04-23 | Paper |
| Counting rooted near-triangulations on the sphere | 1994-03-01 | Paper |
| On chromatic uniqueness of two infinite families of graphs | 1993-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5289580 | 1993-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974300 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5753976 | 1989-01-01 | Paper |
| Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III) | N/A | Paper |
| Partial-dual polynomial as a framed weight system | N/A | Paper |
| A new infinite family of 4-regular crossing-critical graphs | N/A | Paper |
| 4-connected 1-planar chordal graphs are Hamiltonian-connected | N/A | Paper |
