| Publication | Date of Publication | Type |
|---|
| Extremal quasi-unicyclic graphs with respect to vertex-degree function index | 2023-07-04 | Paper |
| Minimizing vertex-degree function index for k-generalized quasi-unicyclic graphs | 2022-11-04 | Paper |
| Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions | 2022-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090634 | 2022-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090749 | 2022-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5074602 | 2022-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5165210 | 2021-11-15 | Paper |
| Extremal vertex-degree function index for trees and unicyclic graphs with given independence number | 2021-11-11 | Paper |
| On the general sum-connectivity index of connected graphs with given order and girth | 2021-08-16 | Paper |
| Unified extremal results for \(k\)-apex unicyclic graphs (trees) | 2020-11-02 | Paper |
| General sum-connectivity index of trees and unicyclic graphs with fixed maximum degree | 2020-10-13 | Paper |
| Some notes on the extremal \(k\)-generalized quasi-unicyclic graphs with respect to Zagreb indices | 2020-07-07 | Paper |
| Extremal \(k\)-generalized quasi unicyclic graphs with respect to first and second Zagreb indices | 2019-11-06 | Paper |
| Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number | 2019-10-02 | Paper |
| Some Bounds on Zeroth-Order General Randi\'c$ Index | 2019-09-07 | Paper |
| Proof of a conjecture concerning maximum general sum-connectivity index \(\chi_\alpha\) of graphs with given cyclomatic number when \(1 < \alpha < 2\) | 2019-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4685248 | 2018-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4684500 | 2018-10-01 | Paper |
| Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number | 2018-09-25 | Paper |
| Zeroth-order general Randi\`c index of $k$-generalized quasi trees | 2018-01-11 | Paper |
| ON RAMSEY NUMBERS OF CYCLES WITH RESPECT EVEN WHEELS OF TWO HUBS | 2017-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4593990 | 2017-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4978077 | 2017-08-17 | Paper |
| Extremal topological indices for graphs of given connectivity | 2017-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2975358 | 2017-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2972781 | 2017-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2811701 | 2016-06-10 | Paper |
| Some Results on Chromaticity of Quasilinear Hypergraphs | 2016-01-05 | Paper |
| Extremal k-apex Trees for Randic Index | 2015-12-07 | Paper |
| Unicyclic graphs of given girth \(k\geq 4\) having smallest general sum-connectivity index | 2015-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2941350 | 2015-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5500098 | 2015-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5500105 | 2015-08-05 | Paper |
| Extremal bicyclic 3-chromatic graphs | 2015-07-20 | Paper |
| On the general sum-connectivity index of connected unicyclic graphs with \(k\) pendant vertices | 2014-12-05 | Paper |
| 2-connected graphs with minimum general sum-connectivity index | 2014-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5412979 | 2014-04-28 | Paper |
| Hypergraphs with pendant paths are not chromatically unique | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403534 | 2014-03-26 | Paper |
| On the chromaticity of quasi linear hypergraphs | 2014-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2856694 | 2013-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2846670 | 2013-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4900325 | 2013-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2918617 | 2012-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2914003 | 2012-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2895395 | 2012-07-02 | Paper |
| On the Connected Partition Dimension of a Wheel Related Graph | 2012-06-15 | Paper |
| Some results on chromaticity of quasi-linear paths and cycles | 2012-06-12 | Paper |
| Metric dimension and \(R\)-sets of connected graphs | 2012-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3090706 | 2011-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999644 | 2011-05-16 | Paper |
| Ordering connected graphs having small degree distances | 2010-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3052835 | 2010-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3568750 | 2010-06-15 | Paper |
| On the Ramsey numbers for paths and generalized Jahangir graphs | 2010-05-14 | Paper |
| Series-parallel chromatic hypergraphs | 2010-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3553815 | 2010-04-21 | Paper |
| Some properties of chromatic coefficients of linear uniform hypergraphs | 2010-01-18 | Paper |
| Properties of connected graphs having minimum degree distance | 2009-12-09 | Paper |
| On the chromaticity of multi-bridge hypergraphs | 2009-12-09 | Paper |
| From rankings’ collinearity to counting SDR's via chromatic list expression | 2009-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5192684 | 2009-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615600 | 2009-03-20 | Paper |
| Discrepancies between metric dimension and partition dimension of a connected graph | 2009-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530898 | 2008-10-21 | Paper |
| The Ramsey numbers of large cycles versus odd wheels | 2008-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442163 | 2008-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442612 | 2008-02-22 | Paper |
| On the number of words containing the factor \((aba)^k\) | 2007-07-19 | Paper |
| On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) | 2007-03-02 | Paper |
| The Ramsey numbers of large cycles versus wheels | 2006-12-14 | Paper |
| A characterization of the words occurring as factors in a minimum number of words | 2006-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5314020 | 2005-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4681319 | 2005-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4659606 | 2005-03-21 | Paper |
| Sunflower hypergraphs are chromatically unique | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808677 | 2004-08-12 | Paper |
| On the number of occurrences of all short factors in almost all words. | 2003-08-17 | Paper |
| Maximal σ‐polynomials of connected 3‐chromatic graphs | 2003-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4483935 | 2003-05-27 | Paper |
| Irreducible coverings by cliques and Sperner's theorem | 2003-05-13 | Paper |
| On the number of \(h\)-connected graphs with a fixed diameter | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542640 | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2737546 | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2752140 | 2002-05-07 | Paper |
| On the number of graphs and \(h\)-hypergraphs with bounded diameter | 2002-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760453 | 2002-01-02 | Paper |
| On the number of large \(h\)-hypergraphs with a fixed diameter | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520509 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520527 | 2001-02-26 | Paper |
| Some extremal properties of the degree distance of a graph | 2000-03-07 | Paper |
| Chromatic coefficients of linear uniform hypergraphs | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390871 | 1998-10-05 | Paper |
| On words containing all short subwords | 1998-08-13 | Paper |
| Maximum chromatic polynomial of 3-chromatic blocks | 1998-03-16 | Paper |
| On the number of trees having \(k\) edges in common with a graph of bounded degrees | 1997-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284657 | 1997-07-08 | Paper |
| Bonferroni inequalities and negative cycles in large complete signed graphs | 1997-05-04 | Paper |
| On the asymptotic average length of a maximum common subsequence for words over a finite alphabet | 1997-02-27 | Paper |
| An asymptotic formula for the number of graphs having small diameter | 1997-02-26 | Paper |
| On the number of irreducible coverings by edges of complete bipartite graphs | 1996-11-24 | Paper |
| Negative cycles in complete signed graphs | 1996-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4697531 | 1995-08-27 | Paper |
| Maximum chromatic polynomials of 2‐connected graphs | 1995-03-20 | Paper |
| Minimum spanning hypertrees | 1994-11-28 | Paper |
| On the number of subtrees for almost all graphs | 1994-10-20 | Paper |
| Maximum chromatic polynomials of 2‐connected graphs | 1994-06-12 | Paper |
| Ordered \(h\)-hypertrees | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972105 | 1992-06-25 | Paper |
| Almost all digraphs have a kernel | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360205 | 1990-01-01 | Paper |
| Maximal chromatic polynomials of connected planar graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750906 | 1989-01-01 | Paper |
| ON DISTANCES IN CHROMATIC GRAPHS | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491605 | 1989-01-01 | Paper |
| Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons | 1988-01-01 | Paper |
| On 3-colorings of bipartitep-threshold graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202203 | 1987-01-01 | Paper |
| Graphical Eulerian numbers and chromatic generating functions | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3760568 | 1987-01-01 | Paper |
| On the number of paths and cycles for almost all graphs and digraphs | 1986-01-01 | Paper |
| Hypertrees and Bonferroni inequalities | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698832 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3722532 | 1986-01-01 | Paper |
| ON HYPERGRAPH COLOURINGS | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5184913 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3718734 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187327 | 1984-01-01 | Paper |
| A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS | 1984-01-01 | Paper |
| Digital metrics: A graph-theoretical approach | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3344018 | 1984-01-01 | Paper |
| Metric bases in digital geometry | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734444 | 1984-01-01 | Paper |
| Path generated digital metrics | 1983-01-01 | Paper |
| An upper bound for the shortest hamiltonian path in the symmetric euclidean case | 1983-01-01 | Paper |
| On Hamiltonian-connected regular graphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3317158 | 1983-01-01 | Paper |
| Boolean distance for graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3910556 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929773 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3931445 | 1981-01-01 | Paper |
| Asymptotical Estimations for the Number of Cliques of Uniform Hypergraphs | 1981-01-01 | Paper |
| Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets | 1981-01-01 | Paper |
| Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3903031 | 1980-01-01 | Paper |
| Some properties of irreducible coverings by cliques of complete multipartite graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3863915 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3867837 | 1979-01-01 | Paper |
| Le nombre minimal de colorations d'un hypergraphe k-chromatique | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4152568 | 1978-01-01 | Paper |
| Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4149475 | 1977-01-01 | Paper |
| Le nombre maximal de colorations d'un graphe Hamiltonien | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4081280 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4091990 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4135586 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4071770 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083472 | 1975-01-01 | Paper |
| Un algorithme combinatoire pour la résolution des problèmes du type du permanent | 1975-01-01 | Paper |
| La reduction minimale d'un graphe à une reunion de cliques | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5181735 | 1973-01-01 | Paper |
| A Combinatorial Algorithm for Solving Covering Problems | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5682015 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5632600 | 1972-01-01 | Paper |
| A method for minimizing the number of states for a restricted class of incompletely specified sequential machines | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5650419 | 1972-01-01 | Paper |
| Brève communication. Une caractérisation des graphes $k-$chromatiques minimaux sans sommet isolé | 1972-01-01 | Paper |
| A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5670559 | 1972-01-01 | Paper |
| Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph) | 1972-01-01 | Paper |
| The number of connected graphs with \(k\) cycles on labeled nodes | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3214930 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4145736 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5613119 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5628155 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5629650 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5632590 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5641082 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5678780 | 1971-01-01 | Paper |
| Une démonstration du théorème de Dilworth et applications à un problème de couverture des graphes | 1971-01-01 | Paper |
| A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching Network | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5604419 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5613201 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5561999 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5578304 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5578305 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5588119 | 1969-01-01 | Paper |
| La construction des tests minimaux pour les fonctions booleennes symétriques | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5539755 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5542110 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5551307 | 1968-01-01 | Paper |
| Sur l'algorithme matriciel de B. Roy | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5571713 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5590821 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5607592 | 1968-01-01 | Paper |
| Un algorithme pour la détermination des plus petites distances entre les sommets d'un réseau | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5549077 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5564328 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5601473 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5610757 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5531421 | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5543051 | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5560922 | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5543046 | 1965-01-01 | Paper |
