| Publication | Date of Publication | Type |
|---|
On diameter-constrained unicyclic graphs and BID indices
Mediterranean Journal of Mathematics | 2026-03-05 | Paper |
Maximum bond incident degree indices for trees and unicyclic graphs with given maximum degree
Discrete Applied Mathematics | 2026-02-11 | Paper |
Minimizing vertex-degree function index for k-generalized quasi-trees
Bulletin Mathématique de la Société des Sciences Mathématiques de Roumanie. Nouvelle Série | 2025-06-11 | Paper |
Maximum bond incident degree indices of trees with given independence number
MATCH - Communications in Mathematical and in Computer Chemistry | 2024-10-31 | Paper |
Extremal quasi-unicyclic graphs with respect to vertex-degree function index
Electronic Journal of Graph Theory and Applications | 2023-07-04 | Paper |
Minimizing vertex-degree function index for \(k\)-generalized quasi-unicyclic graphs
The Art of Discrete and Applied Mathematics | 2022-11-04 | Paper |
Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions
match Communications in Mathematical and in Computer Chemistry | 2022-09-08 | Paper |
| On a conjecture concerning resolving pairs | 2022-07-20 | Paper |
| Extremal first and second Zagreb indices of apex trees | 2022-07-20 | Paper |
| scientific article; zbMATH DE number 7523847 (Why is no real title available?) | 2022-05-09 | Paper |
| scientific article; zbMATH DE number 7427118 (Why is no real title available?) | 2021-11-15 | Paper |
Extremal vertex-degree function index for trees and unicyclic graphs with given independence number
Discrete Applied Mathematics | 2021-11-11 | Paper |
On the general sum-connectivity index of connected graphs with given order and girth
Electronic Journal of Graph Theory and Applications | 2021-08-16 | Paper |
Unified extremal results for k-apex unicyclic graphs (trees)
Discrete Applied Mathematics | 2020-11-02 | Paper |
General sum-connectivity index of trees and unicyclic graphs with fixed maximum degree
(available as arXiv preprint) | 2020-10-13 | Paper |
Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices
Discrete Applied Mathematics | 2020-07-07 | Paper |
Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices
Discrete Applied Mathematics | 2019-11-06 | Paper |
Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number
The Art of Discrete and Applied Mathematics | 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\)
Discrete Applied Mathematics | 2019-09-05 | Paper |
| Byciclic graphs with minimum general sum-connectivity index for \(-1\leq \alpha <0\) | 2018-10-05 | Paper |
| scientific article; zbMATH DE number 6945759 (Why is no real title available?) | 2018-10-01 | Paper |
Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number
Discrete Applied Mathematics | 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
Far East Journal of Mathematical Sciences (FJMS) | 2017-12-13 | Paper |
| scientific article; zbMATH DE number 6807830 (Why is no real title available?) | 2017-11-16 | Paper |
| Bounds for degree distance of a graph | 2017-08-17 | Paper |
Extremal topological indices for graphs of given connectivity
Filomat | 2017-07-19 | Paper |
| Maximum general sum-connectivity index for trees with given independence number | 2017-04-11 | Paper |
| On path-sunflower Ramsey numbers | 2017-04-07 | Paper |
On metric dimension of convex polytopes with pendant edges.
Ars Combinatoria | 2016-10-26 | Paper |
Unicyclic connected graphs having smallest degree distances
Utilitas Mathematica | 2016-06-10 | Paper |
Some results on chromaticity of quasilinear hypergraphs
Springer Proceedings in Mathematics & Statistics | 2016-01-05 | Paper |
| Extremal k-apex Trees for Randic Index | 2015-12-07 | Paper |
Unicyclic graphs of given girth k 4 having smallest general sum-connectivity index
Discrete Applied Mathematics | 2015-09-22 | Paper |
| Extremal results concerning the general sum-connectivity index in some classes of connected graphs | 2015-08-27 | Paper |
| On metric dimension of uniform subdivisions of the wheel | 2015-08-05 | Paper |
| scientific article; zbMATH DE number 6470676 (Why is no real title available?) | 2015-08-05 | Paper |
Extremal bicyclic 3-chromatic graphs
Graphs and Combinatorics | 2015-07-20 | Paper |
On the general sum-connectivity index of connected unicyclic graphs with \(k\) pendant vertices
Discrete Applied Mathematics | 2014-12-05 | Paper |
2-connected graphs with minimum general sum-connectivity index
Discrete Applied Mathematics | 2014-09-12 | Paper |
| Chromatically equivalent k-bridge hypergraphs | 2014-04-28 | Paper |
Hypergraphs with pendant paths are not chromatically unique
Discussiones Mathematicae Graph Theory | 2014-04-02 | Paper |
| scientific article; zbMATH DE number 6274853 (Why is no real title available?) | 2014-03-26 | Paper |
On the chromaticity of quasi linear hypergraphs
Graphs and Combinatorics | 2014-02-14 | Paper |
On metric dimension of flower graphs \(f_{n \times m}\) and convex polytopes
Utilitas Mathematica | 2014-01-21 | Paper |
Ordering connected graphs having small degree distances. II
MATCH - Communications in Mathematical and in Computer Chemistry | 2013-10-30 | Paper |
On the cyclomatic number of linear hypergraphs.
Ars Combinatoria | 2013-09-09 | Paper |
| On the ratio between partition dimension and metric dimension of a connected graph | 2013-01-14 | Paper |
Magic graphs with pendant edges.
Ars Combinatoria | 2012-10-08 | Paper |
Extremal properties of the chromatic polynomials of connected 3-chromatic graphs
Matematički Vesnik | 2012-09-21 | Paper |
On vertext-magic total labeling of some families of rotationally-symmetric graphs
Utilitas Mathematica | 2012-07-02 | Paper |
On the connected partition dimension of a wheel related graph
Computation, Physics and Beyond | 2012-06-15 | Paper |
Some results on chromaticity of quasi-linear paths and cycles
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Metric dimension and \(R\)-sets of connected graphs
Graphs and Combinatorics | 2012-01-24 | Paper |
| Connected graphs of diameter two having small degree distances | 2011-08-31 | Paper |
| Graphs with same diameter and metric dimension | 2011-05-16 | Paper |
Ordering connected graphs having small degree distances
Discrete Applied Mathematics | 2010-11-05 | Paper |
| On star partition dimension of the generalized gear graph | 2010-11-02 | Paper |
| On the partition dimension and connected partition dimension of wheels. | 2010-06-15 | Paper |
On the Ramsey number for paths and beaded wheels
(available as arXiv preprint) | 2010-05-14 | Paper |
Series-parallel chromatic hypergraphs
Discrete Applied Mathematics | 2010-05-05 | Paper |
| On metric and partition dimensions of some infinite regular graphs | 2010-04-21 | Paper |
Some properties of chromatic coefficients of linear uniform hypergraphs
Graphs and Combinatorics | 2010-01-18 | Paper |
Properties of connected graphs having minimum degree distance
Discrete Mathematics | 2009-12-09 | Paper |
On the chromaticity of multi-bridge hypergraphs
Graphs and Combinatorics | 2009-12-09 | Paper |
From rankings’ collinearity to counting SDR's via chromatic list expression
International Journal of Computer Mathematics | 2009-09-18 | Paper |
| Threshold properties of some periodic factors of words over a finite alphabet | 2009-08-10 | Paper |
| On the Ramsey numbers for paths and generalized Jahangir graphs \(J_{s,m}\) | 2009-03-20 | Paper |
Discrepancies between metric dimension and partition dimension of a connected graph
Discrete Mathematics | 2009-01-27 | Paper |
| On the metric dimension of the Jahangir graph | 2008-10-21 | Paper |
The Ramsey numbers of large cycles versus odd wheels
Graphs and Combinatorics | 2008-04-16 | Paper |
| Extremal and asymptotic properties of irreducible coverings of graphs by cliques | 2008-02-22 | Paper |
| scientific article; zbMATH DE number 5238589 (Why is no real title available?) | 2008-02-22 | Paper |
On the number of words containing the factor \((aba)^k\)
Discrete Applied Mathematics | 2007-07-19 | Paper |
On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
Discrete Mathematics | 2007-03-02 | Paper |
The Ramsey numbers of large cycles versus wheels
Discrete Mathematics | 2006-12-14 | Paper |
A characterization of the words occurring as factors in a minimum number of words
Theoretical Computer Science | 2006-03-24 | Paper |
| scientific article; zbMATH DE number 2201825 (Why is no real title available?) | 2005-09-02 | Paper |
| scientific article; zbMATH DE number 2182450 (Why is no real title available?) | 2005-06-23 | Paper |
| scientific article; zbMATH DE number 2147948 (Why is no real title available?) | 2005-03-21 | Paper |
Sunflower hypergraphs are chromatically unique
Discrete Mathematics | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2090010 (Why is no real title available?) | 2004-08-12 | Paper |
On the number of occurrences of all short factors in almost all words.
Theoretical Computer Science | 2003-08-17 | Paper |
Maximal σ‐polynomials of connected 3‐chromatic graphs
Journal of Graph Theory | 2003-07-31 | Paper |
| scientific article; zbMATH DE number 1919524 (Why is no real title available?) | 2003-05-27 | Paper |
| scientific article; zbMATH DE number 1919524 (Why is no real title available?) | 2003-05-27 | Paper |
Irreducible coverings by cliques and Sperner's theorem
The Electronic Journal of Combinatorics | 2003-05-13 | Paper |
Irreducible coverings by cliques and Sperner's theorem
The Electronic Journal of Combinatorics | 2003-05-13 | Paper |
On the number of \(h\)-connected graphs with a fixed diameter
Discrete Mathematics | 2002-08-29 | Paper |
| scientific article; zbMATH DE number 1775510 (Why is no real title available?) | 2002-08-04 | Paper |
| Some extremal properties of the degree distance of a graph | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1665442 (Why is no real title available?) | 2002-05-07 | Paper |
On the number of graphs and \(h\)-hypergraphs with bounded diameter
Discrete Mathematics | 2002-02-17 | Paper |
The number of h-strongly connected digraphs with small diameter
The Australasian Journal of Combinatorics | 2002-01-02 | Paper |
On the number of large h-hypergraphs with a fixed diameter
Discrete Mathematics | 2001-10-30 | Paper |
| scientific article; zbMATH DE number 1543071 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1543056 (Why is no real title available?) | 2001-02-26 | Paper |
Some extremal properties of the degree distance of a graph
Discrete Applied Mathematics | 2000-03-07 | Paper |
Chromatic coefficients of linear uniform hypergraphs
Journal of Combinatorial Theory. Series B | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1156874 (Why is no real title available?) | 1998-10-05 | Paper |
On words containing all short subwords
Theoretical Computer Science | 1998-08-13 | Paper |
Maximum chromatic polynomial of 3-chromatic blocks
Discrete Mathematics | 1998-03-16 | Paper |
On the number of trees having \(k\) edges in common with a graph of bounded degrees
Discrete Mathematics | 1997-10-12 | Paper |
| scientific article; zbMATH DE number 969185 (Why is no real title available?) | 1997-07-08 | Paper |
Bonferroni inequalities and negative cycles in large complete signed graphs
European Journal of Combinatorics | 1997-05-04 | Paper |
On the asymptotic average length of a maximum common subsequence for words over a finite alphabet
Theoretical Computer Science | 1997-02-27 | Paper |
An asymptotic formula for the number of graphs having small diameter
Discrete Mathematics | 1997-02-26 | Paper |
On the number of irreducible coverings by edges of complete bipartite graphs
Discrete Mathematics | 1996-11-24 | Paper |
Negative cycles in complete signed graphs
Discrete Applied Mathematics | 1996-11-19 | Paper |
| scientific article; zbMATH DE number 749225 (Why is no real title available?) | 1995-08-27 | Paper |
Maximum chromatic polynomials of 2‐connected graphs
Journal of Graph Theory | 1995-03-20 | Paper |
Minimum spanning hypertrees
Discrete Applied Mathematics | 1994-11-28 | Paper |
On the number of subtrees for almost all graphs
Random Structures & Algorithms | 1994-10-20 | Paper |
Maximum chromatic polynomials of 2‐connected graphs
Journal of Graph Theory | 1994-06-12 | Paper |
Ordered \(h\)-hypertrees
Discrete Mathematics | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 15467 (Why is no real title available?) | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4212085 (Why is no real title available?) | 1990-01-01 | Paper |
Almost all digraphs have a kernel
Discrete Mathematics | 1990-01-01 | Paper |
Maximal chromatic polynomials of connected planar graphs
Journal of Graph Theory | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4185669 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4164905 (Why is no real title available?) | 1989-01-01 | Paper |
ON DISTANCES IN CHROMATIC GRAPHS
The Quarterly Journal of Mathematics | 1989-01-01 | Paper |
Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons
Discrete Applied Mathematics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4193701 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4010547 (Why is no real title available?) | 1987-01-01 | Paper |
On 3-colorings of bipartitep-threshold graphs
Journal of Graph Theory | 1987-01-01 | Paper |
Graphical Eulerian numbers and chromatic generating functions
Discrete Mathematics | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3922702 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3952804 (Why is no real title available?) | 1986-01-01 | Paper |
ON HYPERGRAPH COLOURINGS
The Quarterly Journal of Mathematics | 1986-01-01 | Paper |
Hypertrees and Bonferroni inequalities
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
On the number of paths and cycles for almost all graphs and digraphs
Combinatorica | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3893204 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3948293 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3895118 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3966126 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3878964 (Why is no real title available?) | 1984-01-01 | Paper |
Metric bases in digital geometry
Computer Vision, Graphics, and Image Processing | 1984-01-01 | Paper |
Digital metrics: A graph-theoretical approach
Pattern Recognition Letters | 1984-01-01 | Paper |
A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS
The Quarterly Journal of Mathematics | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3847448 (Why is no real title available?) | 1983-01-01 | Paper |
Path generated digital metrics
Pattern Recognition Letters | 1983-01-01 | Paper |
On Hamiltonian-connected regular graphs
Journal of Graph Theory | 1983-01-01 | Paper |
An upper bound for the shortest hamiltonian path in the symmetric euclidean case
RAIRO - Operations Research | 1983-01-01 | Paper |
Boolean distance for graphs
Discrete Mathematics | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3720955 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3743310 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3745243 (Why is no real title available?) | 1981-01-01 | Paper |
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets
Discrete Mathematics | 1981-01-01 | Paper |
Asymptotical Estimations for the Number of Cliques of Uniform Hypergraphs
North-Holland Mathematics Studies | 1981-01-01 | Paper |
Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes
Calcolo | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3711996 (Why is no real title available?) | 1980-01-01 | Paper |
Some properties of irreducible coverings by cliques of complete multipartite graphs
Journal of Combinatorial Theory. Series B | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3664992 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3670481 (Why is no real title available?) | 1979-01-01 | Paper |
Le nombre minimal de colorations d'un hypergraphe k-chromatique
Discrete Mathematics | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3582182 (Why is no real title available?) | 1978-01-01 | Paper |
Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques
Calcolo | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3580568 (Why is no real title available?) | 1977-01-01 | Paper |
Le nombre maximal de colorations d'un graphe Hamiltonien
Discrete Mathematics | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3512159 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3512159 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3499792 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3563168 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3489152 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3503298 (Why is no real title available?) | 1975-01-01 | Paper |
Un algorithme combinatoire pour la résolution des problèmes du type du permanent
Calcolo | 1975-01-01 | Paper |
La reduction minimale d'un graphe à une reunion de cliques
Discrete Mathematics | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3419168 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3419168 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3428980 (Why is no real title available?) | 1973-01-01 | Paper |
A Combinatorial Algorithm for Solving Covering Problems
IEEE Transactions on Computers | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3380657 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3404163 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3358510 (Why is no real title available?) | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3427359 (Why is no real title available?) | 1972-01-01 | Paper |
Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)
Discrete Mathematics | 1972-01-01 | Paper |
The number of connected graphs with \(k\) cycles on labeled nodes
Calcolo | 1972-01-01 | Paper |
A method for minimizing the number of states for a restricted class of incompletely specified sequential machines
Mathematical Systems Theory | 1972-01-01 | Paper |
Brève communication. Une caractérisation des graphes k-chromatiques minimaux sans sommet isolé
Revue française d'automatique informatique recherche opérationnelle. Mathématique | 1972-01-01 | Paper |
A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine
IEEE Transactions on Computers | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3358496 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3368554 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3414211 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3353319 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3335813 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3573909 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3355055 (Why is no real title available?) | 1971-01-01 | Paper |
Une démonstration du théorème de Dilworth et applications à un problème de couverture des graphes
Calcolo | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3325521 (Why is no real title available?) | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3335937 (Why is no real title available?) | 1970-01-01 | Paper |
A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching Network
IEEE Transactions on Computers | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3277532 (Why is no real title available?) | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3296031 (Why is no real title available?) | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3296032 (Why is no real title available?) | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3307015 (Why is no real title available?) | 1969-01-01 | Paper |
La construction des tests minimaux pour les fonctions booleennes symétriques
Calcolo | 1969-01-01 | Paper |
Sur l'algorithme matriciel de B. Roy
Revue française d'informatique et de recherche opérationnelle | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3264781 (Why is no real title available?) | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3253173 (Why is no real title available?) | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3255714 (Why is no real title available?) | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3288608 (Why is no real title available?) | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3310096 (Why is no real title available?) | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3329473 (Why is no real title available?) | 1968-01-01 | Paper |
Un algorithme pour la détermination des plus petites distances entre les sommets d'un réseau
Revue française d'informatique et de recherche opérationnelle | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3284288 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3263271 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3322091 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3331983 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3244267 (Why is no real title available?) | 1966-01-01 | Paper |
| scientific article; zbMATH DE number 3257820 (Why is no real title available?) | 1966-01-01 | Paper |
| scientific article; zbMATH DE number 3276430 (Why is no real title available?) | 1966-01-01 | Paper |
| scientific article; zbMATH DE number 3257817 (Why is no real title available?) | 1965-01-01 | Paper |
