Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Ioan Tomescu - MaRDI portal

Ioan Tomescu

From MaRDI portal
(Redirected from Person:1170203)
Person:190560

Available identifiers

zbMath Open tomescu.ioanDBLP06/2509WikidataQ12730735 ScholiaQ12730735MaRDI QIDQ190560

List of research outcomes





PublicationDate of PublicationType
Maximum bond incident degree indices of trees with given independence number2024-10-31Paper
Extremal quasi-unicyclic graphs with respect to vertex-degree function index2023-07-04Paper
Minimizing vertex-degree function index for k-generalized quasi-unicyclic graphs2022-11-04Paper
Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions2022-09-08Paper
https://portal.mardi4nfdi.de/entity/Q50906342022-07-20Paper
https://portal.mardi4nfdi.de/entity/Q50907492022-07-20Paper
https://portal.mardi4nfdi.de/entity/Q50746022022-05-09Paper
https://portal.mardi4nfdi.de/entity/Q51652102021-11-15Paper
Extremal vertex-degree function index for trees and unicyclic graphs with given independence number2021-11-11Paper
On the general sum-connectivity index of connected graphs with given order and girth2021-08-16Paper
Unified extremal results for \(k\)-apex unicyclic graphs (trees)2020-11-02Paper
General sum-connectivity index of trees and unicyclic graphs with fixed maximum degree2020-10-13Paper
Some notes on the extremal \(k\)-generalized quasi-unicyclic graphs with respect to Zagreb indices2020-07-07Paper
Extremal \(k\)-generalized quasi unicyclic graphs with respect to first and second Zagreb indices2019-11-06Paper
Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number2019-10-02Paper
Some Bounds on Zeroth-Order General Randi\'c$ Index2019-09-07Paper
Proof of a conjecture concerning maximum general sum-connectivity index \(\chi_\alpha\) of graphs with given cyclomatic number when \(1 < \alpha < 2\)2019-09-05Paper
https://portal.mardi4nfdi.de/entity/Q46852482018-10-05Paper
https://portal.mardi4nfdi.de/entity/Q46845002018-10-01Paper
Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number2018-09-25Paper
Zeroth-order general Randi\`c index of $k$-generalized quasi trees2018-01-11Paper
ON RAMSEY NUMBERS OF CYCLES WITH RESPECT EVEN WHEELS OF TWO HUBS2017-12-13Paper
https://portal.mardi4nfdi.de/entity/Q45939902017-11-16Paper
https://portal.mardi4nfdi.de/entity/Q49780772017-08-17Paper
Extremal topological indices for graphs of given connectivity2017-07-19Paper
https://portal.mardi4nfdi.de/entity/Q29753582017-04-11Paper
https://portal.mardi4nfdi.de/entity/Q29727812017-04-07Paper
https://portal.mardi4nfdi.de/entity/Q28117012016-06-10Paper
Some Results on Chromaticity of Quasilinear Hypergraphs2016-01-05Paper
Extremal k-apex Trees for Randic Index2015-12-07Paper
Unicyclic graphs of given girth \(k\geq 4\) having smallest general sum-connectivity index2015-09-22Paper
https://portal.mardi4nfdi.de/entity/Q29413502015-08-27Paper
https://portal.mardi4nfdi.de/entity/Q55000982015-08-05Paper
https://portal.mardi4nfdi.de/entity/Q55001052015-08-05Paper
Extremal bicyclic 3-chromatic graphs2015-07-20Paper
On the general sum-connectivity index of connected unicyclic graphs with \(k\) pendant vertices2014-12-05Paper
2-connected graphs with minimum general sum-connectivity index2014-09-12Paper
https://portal.mardi4nfdi.de/entity/Q54129792014-04-28Paper
Hypergraphs with pendant paths are not chromatically unique2014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q54035342014-03-26Paper
On the chromaticity of quasi linear hypergraphs2014-02-14Paper
https://portal.mardi4nfdi.de/entity/Q28566942013-10-30Paper
https://portal.mardi4nfdi.de/entity/Q28466702013-09-09Paper
https://portal.mardi4nfdi.de/entity/Q49003252013-01-14Paper
https://portal.mardi4nfdi.de/entity/Q29186172012-10-08Paper
https://portal.mardi4nfdi.de/entity/Q29140032012-09-21Paper
https://portal.mardi4nfdi.de/entity/Q28953952012-07-02Paper
On the Connected Partition Dimension of a Wheel Related Graph2012-06-15Paper
Some results on chromaticity of quasi-linear paths and cycles2012-06-12Paper
Metric dimension and \(R\)-sets of connected graphs2012-01-24Paper
https://portal.mardi4nfdi.de/entity/Q30907062011-08-31Paper
https://portal.mardi4nfdi.de/entity/Q29996442011-05-16Paper
Ordering connected graphs having small degree distances2010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30528352010-11-02Paper
https://portal.mardi4nfdi.de/entity/Q35687502010-06-15Paper
On the Ramsey numbers for paths and generalized Jahangir graphs2010-05-14Paper
Series-parallel chromatic hypergraphs2010-05-05Paper
https://portal.mardi4nfdi.de/entity/Q35538152010-04-21Paper
Some properties of chromatic coefficients of linear uniform hypergraphs2010-01-18Paper
Properties of connected graphs having minimum degree distance2009-12-09Paper
On the chromaticity of multi-bridge hypergraphs2009-12-09Paper
From rankings’ collinearity to counting SDR's via chromatic list expression2009-09-18Paper
https://portal.mardi4nfdi.de/entity/Q51926842009-08-10Paper
https://portal.mardi4nfdi.de/entity/Q36156002009-03-20Paper
Discrepancies between metric dimension and partition dimension of a connected graph2009-01-27Paper
https://portal.mardi4nfdi.de/entity/Q35308982008-10-21Paper
The Ramsey numbers of large cycles versus odd wheels2008-04-16Paper
https://portal.mardi4nfdi.de/entity/Q54421632008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54426122008-02-22Paper
On the number of words containing the factor \((aba)^k\)2007-07-19Paper
On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)2007-03-02Paper
The Ramsey numbers of large cycles versus wheels2006-12-14Paper
A characterization of the words occurring as factors in a minimum number of words2006-03-24Paper
https://portal.mardi4nfdi.de/entity/Q53140202005-09-02Paper
https://portal.mardi4nfdi.de/entity/Q46813192005-06-23Paper
https://portal.mardi4nfdi.de/entity/Q46596062005-03-21Paper
Sunflower hypergraphs are chromatically unique2004-08-19Paper
https://portal.mardi4nfdi.de/entity/Q48086772004-08-12Paper
On the number of occurrences of all short factors in almost all words.2003-08-17Paper
Maximal σ‐polynomials of connected 3‐chromatic graphs2003-07-31Paper
https://portal.mardi4nfdi.de/entity/Q44839352003-05-27Paper
Irreducible coverings by cliques and Sperner's theorem2003-05-13Paper
On the number of \(h\)-connected graphs with a fixed diameter2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45426402002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q27375462002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q27521402002-05-07Paper
On the number of graphs and \(h\)-hypergraphs with bounded diameter2002-02-17Paper
https://portal.mardi4nfdi.de/entity/Q27604532002-01-02Paper
On the number of large \(h\)-hypergraphs with a fixed diameter2001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q45205092001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q45205272001-02-26Paper
Some extremal properties of the degree distance of a graph2000-03-07Paper
Chromatic coefficients of linear uniform hypergraphs1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q43908711998-10-05Paper
On words containing all short subwords1998-08-13Paper
Maximum chromatic polynomial of 3-chromatic blocks1998-03-16Paper
On the number of trees having \(k\) edges in common with a graph of bounded degrees1997-10-12Paper
https://portal.mardi4nfdi.de/entity/Q52846571997-07-08Paper
Bonferroni inequalities and negative cycles in large complete signed graphs1997-05-04Paper
On the asymptotic average length of a maximum common subsequence for words over a finite alphabet1997-02-27Paper
An asymptotic formula for the number of graphs having small diameter1997-02-26Paper
On the number of irreducible coverings by edges of complete bipartite graphs1996-11-24Paper
Negative cycles in complete signed graphs1996-11-19Paper
https://portal.mardi4nfdi.de/entity/Q46975311995-08-27Paper
Maximum chromatic polynomials of 2‐connected graphs1995-03-20Paper
Minimum spanning hypertrees1994-11-28Paper
On the number of subtrees for almost all graphs1994-10-20Paper
Maximum chromatic polynomials of 2‐connected graphs1994-06-12Paper
Ordered \(h\)-hypertrees1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39721051992-06-25Paper
Almost all digraphs have a kernel1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33602051990-01-01Paper
Maximal chromatic polynomials of connected planar graphs1990-01-01Paper
ON DISTANCES IN CHROMATIC GRAPHS1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34916051989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57509061989-01-01Paper
Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons1988-01-01Paper
Graphical Eulerian numbers and chromatic generating functions1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37605681987-01-01Paper
On 3-colorings of bipartitep-threshold graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52022031987-01-01Paper
On the number of paths and cycles for almost all graphs and digraphs1986-01-01Paper
Hypertrees and Bonferroni inequalities1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36988321986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37225321986-01-01Paper
ON HYPERGRAPH COLOURINGS1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37187341985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849131985-01-01Paper
A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS1984-01-01Paper
Digital metrics: A graph-theoretical approach1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33440181984-01-01Paper
Metric bases in digital geometry1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37344441984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51873271984-01-01Paper
An upper bound for the shortest hamiltonian path in the symmetric euclidean case1983-01-01Paper
On Hamiltonian-connected regular graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33171581983-01-01Paper
Path generated digital metrics1983-01-01Paper
Boolean distance for graphs1982-01-01Paper
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets1981-01-01Paper
Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39105561981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39297731981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39314451981-01-01Paper
Asymptotical Estimations for the Number of Cliques of Uniform Hypergraphs1981-01-01Paper
Some properties of irreducible coverings by cliques of complete multipartite graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39030311980-01-01Paper
Le nombre minimal de colorations d'un hypergraphe k-chromatique1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38639151979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38678371979-01-01Paper
Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41525681978-01-01Paper
Le nombre maximal de colorations d'un graphe Hamiltonien1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41494751977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40812801976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40919901976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41355861976-01-01Paper
Un algorithme combinatoire pour la résolution des problèmes du type du permanent1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40717701975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40834721975-01-01Paper
La reduction minimale d'un graphe à une reunion de cliques1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51817351973-01-01Paper
A Combinatorial Algorithm for Solving Covering Problems1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56820151973-01-01Paper
Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)1972-01-01Paper
The number of connected graphs with \(k\) cycles on labeled nodes1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32149301972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56326001972-01-01Paper
A method for minimizing the number of states for a restricted class of incompletely specified sequential machines1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56504191972-01-01Paper
Brève communication. Une caractérisation des graphes $k-$chromatiques minimaux sans sommet isolé1972-01-01Paper
A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56705591972-01-01Paper
Une démonstration du théorème de Dilworth et applications à un problème de couverture des graphes1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41457361971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56131191971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56281551971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56296501971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56325901971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56410821971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56787801971-01-01Paper
A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching Network1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56044191970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56132011970-01-01Paper
La construction des tests minimaux pour les fonctions booleennes symétriques1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55619991969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55783041969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55783051969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55881191969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55397551968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55421101968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55513071968-01-01Paper
Sur l'algorithme matriciel de B. Roy1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55717131968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55908211968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56075921968-01-01Paper
Un algorithme pour la détermination des plus petites distances entre les sommets d'un réseau1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55490771967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55643281967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56014731967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56107571967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55314211966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55430511966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55609221966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55430461965-01-01Paper

Research outcomes over time

This page was built for person: Ioan Tomescu