default search action
Ioan Tomescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j89]Ioan Tomescu:
Extremal quasi-unicyclic graphs with respect to vertex-degree function index. Electron. J. Graph Theory Appl. 11(1): 39-48 (2023) - 2022
- [j88]Ioan Tomescu:
Minimizing vertex-degree function index for k-generalized quasi-unicyclic graphs. Art Discret. Appl. Math. 5(1) (2022) - [j87]Ioan Tomescu
:
Extremal vertex-degree function index for trees and unicyclic graphs with given independence number. Discret. Appl. Math. 306: 83-88 (2022) - 2021
- [j86]Muhuo Liu
Unified extremal results for k-apex unicyclic graphs (trees). Discret. Appl. Math. 288: 35-49 (2021) - 2020
- [j85]Muhuo Liu
Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices. Discret. Appl. Math. 284: 616-621 (2020)
2010 – 2019
- 2019
- [j84]Ioan Tomescu:
Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number. Art Discret. Appl. Math. 2(1): #P1.03 (2019) - [j83]Ioan Tomescu:
Proof of a conjecture concerning maximum general sum-connectivity index χα of graphs with given cyclomatic number when 1α2. Discret. Appl. Math. 267: 219-223 (2019) - [j82]Faisal Javaid, Muhammad Kamran Jamil
Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices. Discret. Appl. Math. 270: 153-158 (2019) - [c5]Mihaita Dragan, Ioan Tomescu:
Bicyclic Connected Graphs Having Smallest Degree Distances. SYNASC 2019: 105-108 - 2018
- [j81]Muhammad Kamran Jamil, Ioan Tomescu:
First Reformulated Zagreb Index And Some Graph Operations. Ars Comb. 138: 193-209 (2018) - 2017
- [j80]Muhammad Kamran Jamil
Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number. Discret. Appl. Math. 222: 143-150 (2017) - 2016
- [j79]Muhammad Imran, Syed Ahtsham Ul Haq Bokhary, Abdul Qudair Baig, Ioan Tomescu:
On metric dimension of convex polytopes with pendant edges. Ars Comb. 125: 433-447 (2016) - [j78]Ioan Tomescu
On the general sum-connectivity index of connected graphs with given order and girth. Electron. J. Graph Theory Appl. 4(1): 1-7 (2016) - 2015
- [j77]Ioan Tomescu
On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices. Discret. Appl. Math. 181: 306-309 (2015) - [j76]Ioan Tomescu
Extremal Bicyclic 3-Chromatic Graphs. Graphs Comb. 31(4): 1043-1052 (2015) - [c4]Rozica-Maria Tache, Ioan Tomescu
General Sum-Connectivity Index with α ≥ 1 for Trees and Unicyclic Graphs with k Pendants. SYNASC 2015: 307-311 - 2014
- [j75]Muhammad Imran, Abdul Qudair Baig, Muhammad Kashif Shafiq, Ioan Tomescu:
On Metric Dimension of Generalized Petersen Graphs P(n, 3). Ars Comb. 117: 113-130 (2014) - [j74]Ioan Tomescu
Unicyclic graphs of given girth k≥4 having smallest general sum-connectivity index. Discret. Appl. Math. 164: 344-348 (2014) - [j73]Ioan Tomescu
2-Connected graphs with minimum general sum-connectivity index. Discret. Appl. Math. 178: 135-141 (2014) - [j72]Ioan Tomescu
Hypergraphs with pendant paths are not chromatically unique. Discuss. Math. Graph Theory 34(1): 23-29 (2014) - 2013
- [j71]Ioan Tomescu
On the Chromaticity of Quasi Linear Hypergraphs. Graphs Comb. 29(6): 1921-1926 (2013) - 2012
- [j70]M. Tariq Rahim, Ioan Tomescu:
Multi-level distance labelings for helm graphs. Ars Comb. 104: 513-523 (2012) - [j69]Ioan Tomescu, Akhlaq Ahmad Bhatti:
On The Cyclomatic Number Of Linear Hypergraphs. Ars Comb. 106: 527-533 (2012) - [j68]Ioan Tomescu:
Some Results on Chromaticity of Quasi-Linear Paths and Cycles. Electron. J. Comb. 19(2): 23 (2012) - [c3]Ioan Tomescu
On the Connected Partition Dimension of a Wheel Related Graph. Computation, Physics and Beyond 2012: 417-424 - 2011
- [j67]Ngurah Anak Agung Gede, Edy Tri Baskoro, Ioan Tomescu:
Magic graphs with pendant edges. Ars Comb. 99: 149-160 (2011) - [j66]Ioan Tomescu
Metric Dimension and R-Sets of Connected Graphs. Graphs Comb. 27(4): 585-591 (2011) - 2010
- [j65]Ioan Tomescu
Series-parallel chromatic hypergraphs. Discret. Appl. Math. 158(3): 198-203 (2010) - [j64]Ioan Tomescu
Ordering connected graphs having small degree distances. Discret. Appl. Math. 158(15): 1714-1717 (2010)
2000 – 2009
- 2009
- [j63]Ioan Tomescu
Properties of connected graphs having minimum degree distance. Discret. Math. 309(9): 2745-2748 (2009) - [j62]Syed Ahtsham Ul Haq Bokhary
On the Chromaticity of Multi-Bridge Hypergraphs. Graphs Comb. 25(2): 145-152 (2009) - [j61]Ioan Tomescu
Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs. Graphs Comb. 25(4): 639-646 (2009) - [j60]Liviu Petrisor Dinu, Ioan Tomescu
From rankings' collinearity to counting SDR's via chromatic list expression. Int. J. Comput. Math. 86(9): 1483-1489 (2009) - 2008
- [j59]Ioan Tomescu
Discrepancies between metric dimension and partition dimension of a connected graph. Discret. Math. 308(22): 5026-5031 (2008) - [j58]Surahmat, Edy Tri Baskoro
The Ramsey Numbers of Large cycles Versus Odd Wheels. Graphs Comb. 24(1): 53-58 (2008) - [j57]Ioan Tomescu:
Threshold Properties of Some Periodic Factors of Words over a Finite Alphabet. J. Autom. Lang. Comb. 13(2): 145-156 (2008) - 2007
- [j56]Ioan Tomescu, Imran Javaid, Slamin:
On the partition dimension and connected partition dimension of wheels. Ars Comb. 84 (2007) - [j55]Ioan Tomescu
On the number of words containing the factor (aba)k. Discret. Appl. Math. 155(11): 1506-1511 (2007) - [j54]Ioan Tomescu
On the chromaticity of sunflower hypergraphs SH(n, p, h). Discret. Math. 307(6): 781-786 (2007) - 2006
- [j53]Surahmat, Edy Tri Baskoro
The Ramsey numbers of large cycles versus wheels. Discret. Math. 306(24): 3334-3337 (2006) - [j52]Ioan Tomescu
A characterization of the words occurring as factors in a minimum number of words. Theor. Comput. Sci. 352(1-3): 329-331 (2006) - 2005
- [j51]Ioan Tomescu:
Almost all graphs and h-hypergraphs have small diameter. Australas. J Comb. 31: 313-324 (2005) - [j50]Ioan Tomescu:
Asymptotic Properties of the Factors of Words Over a Finite Alphabet. Fundam. Informaticae 64(1-4): 463-470 (2005) - 2004
- [j49]Ioan Tomescu
Sunflower hypergraphs are chromatically unique. Discret. Math. 285(1-3): 355-357 (2004) - 2003
- [j48]Ioan Tomescu
Maximal σ-polynomials of connected 3-chromatic graphs. J. Graph Theory 43(3): 210-222 (2003) - [j47]Ioan Tomescu
On the number of occurrences of all short factors in almost all words. Theor. Comput. Sci. 290(3): 2031-2035 (2003) - 2002
- [j46]Ioan Tomescu:
Irreducible Coverings by Cliques and Sperner's Theorem. Electron. J. Comb. 9(1) (2002) - [j45]Ioan Tomescu
On the number of h-connected graphs with a fixed diameter. Discret. Math. 252(1-3): 279-285 (2002) - [c2]Ioan Tomescu:
On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques. COCOON 2002: 544-553 - 2001
- [j44]Ioan Tomescu:
The number of h-strongly connected digraphs with small diameter. Australas. J Comb. 24: 305-312 (2001) - [j43]Ioan Tomescu
On the number of graphs and h-hypergraphs with bounded diameter. Discret. Math. 235(1-3): 291-299 (2001) - [c1]Ioan Tomescu:
The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity. DMTCS 2001: 33-46 - 2000
- [j42]Ioan Tomescu
On the number of large h-hypergraphs with a fixed diameter. Discret. Math. 223(1-3): 287-297 (2000) - [j41]Ioan Tomescu, Kee-Wai Lau, O. P. Lossers, Kenneth F. Andersen, Robin J. Chapman, Óscar Ciaurri, E. Fernandez, Valerio De Angelis, Emeric Deutsch, G. Will, M. Falkowitz, Zachary Franco, C. Georghiou, J. Lewandowski, Albert Nijenhuis, Timothy S. Norfolk, Allen Stenger:
Complex Roots of a Polynomial: 10688. Am. Math. Mon. 107(2): 181-182 (2000)
1990 – 1999
- 1999
- [j40]Ioan Tomescu
Some Extremal Properties of the Degree Distance of a Graph. Discret. Appl. Math. 98(1-2): 159-163 (1999) - 1998
- [j39]Ioan Tomescu:
A Threshold Property Concerning Words Containing All Short Factors. Bull. EATCS 64 (1998) - [j38]Ioan Tomescu
Chromatic Coefficients of Linear Uniform Hypergraphs. J. Comb. Theory B 72(2): 229-235 (1998) - [j37]Ioan Tomescu
On Words Containing all Short Subwords. Theor. Comput. Sci. 197(1-2): 235-240 (1998) - 1997
- [j36]Ioan Tomescu
On the number of trees having k edges in common with a graph of bounded degrees. Discret. Math. 169(1-3): 283-286 (1997) - [j35]Ioan Tomescu
Maximum chromatic polynomial of 3-chromatic blocks. Discret. Math. 172(1-3): 131-139 (1997) - [j34]Ioan Tomescu:
Optimum Huffman Forests. J. Univers. Comput. Sci. 3(7): 813-820 (1997) - [j33]Cristian Calude, Ioan Tomescu:
Optimum Extendible Prefix Codes. J. Univers. Comput. Sci. 3(11): 1167-1179 (1997) - 1996
- [j32]Ioan Tomescu:
The number of digraphs with small diameter. Australas. J Comb. 14: 221-228 (1996) - [j31]Dragos Radu Popescu, Ioan Tomescu
Negative Cycles in Complete Signed Graphs. Discret. Appl. Math. 68(1-2): 145-152 (1996) - [j30]Ioan Tomescu
On the number of irreducible coverings by edges of complete bipartite graphs. Discret. Math. 150(1-3): 453-456 (1996) - [j29]Ioan Tomescu
An asymptotic formula for the number of graphs having small diameter. Discret. Math. 156(1-3): 219-228 (1996) - [j28]Dragos Radu Popescu, Ioan Tomescu
Bonferroni Inequalities and Negative Cycles in Large Complete Signed Graphs. Eur. J. Comb. 17(5): 479-483 (1996) - [j27]Ioan Tomescu
On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet. Theor. Comput. Sci. 164(1&2): 277-285 (1996) - 1994
- [j26]Ioan Tomescu
Minimum Spanning Hypertrees. Discret. Appl. Math. 54(1): 67-76 (1994) - [j25]Ioan Tomescu
Maximum chromatic polynomials of 2-connected graphs. J. Graph Theory 18(4): 329-336 (1994) - [j24]Ioan Tomescu
On the Number of Subtrees for Almost All Graphs. Random Struct. Algorithms 5(1): 205-214 (1994) - 1992
- [j23]Ioan Tomescu
Ordered h-hypertrees. Discret. Math. 105(1-3): 241-248 (1992) - 1990
- [j22]Ioan Tomescu
Almost all digraphs have a kernel. Discret. Math. 84(2): 181-192 (1990) - [j21]Ioan Tomescu
Maximal chromatic polynomials of connected planar graphs. J. Graph Theory 14(1): 101-110 (1990)
1980 – 1989
- 1988
- [j20]Alexandru T. Balaban, Ioan Tomescu
Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons. Discret. Appl. Math. 19(1-3): 5-16 (1988) - 1987
- [j19]Ioan Tomescu
Graphical Eulerian numbers and chromatic generating functions. Discret. Math. 66(3): 315-318 (1987) - [j18]Ioan Tomescu
On 3-colorings of bipartite p-threshold graphs. J. Graph Theory 11(3): 327-338 (1987) - 1986
- [j17]Ioan Tomescu
On the number of paths and cycles for almost all graphs and digraphs. Comb. 6(1): 73-79 (1986) - [j16]Ioan Tomescu
Hypertrees and Bonferroni inequalities. J. Comb. Theory B 41(2): 209-217 (1986) - 1984
- [j15]Robert A. Melter, Ioan Tomescu
Metric bases in digital geometry. Comput. Vis. Graph. Image Process. 25(1): 113-121 (1984) - [j14]Frank Harary, Robert A. Melter, Ioan Tomescu
Digital metrics: A graph-theoretical approach. Pattern Recognit. Lett. 2(3): 159-163 (1984) - 1983
- [j13]Ioan Tomescu
On Hamiltonian-connected regular graphs. J. Graph Theory 7(4): 429-436 (1983) - [j12]Robert A. Melter, Ioan Tomescu
Path generated digital metrics. Pattern Recognit. Lett. 1(3): 151-154 (1983) - 1982
- [j11]Frank Harary, Robert A. Melter, Uri N. Peled, Ioan Tomescu
Boolean distance for graphs. Discret. Math. 39(2): 123-127 (1982) - 1981
- [j10]Ioan Tomescu
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets. Discret. Math. 37(2-3): 263-277 (1981) - 1980
- [j9]Ioan Tomescu
Some properties of irreducible coverings by cliques of complete multipartite graphs. J. Comb. Theory B 28(2): 127-141 (1980)
1970 – 1979
- 1979
- [j8]Ioan Tomescu
Le nombre minimal de colorations d'un hypergraphe k-chromatique. Discret. Math. 25(2): 179-188 (1979) - 1976
- [j7]Ioan Tomescu
Le nombre maximal de colorations d'un graphe hamiltonien. Discret. Math. 16(4): 353-359 (1976) - 1974
- [j6]Ioan Tomescu
La reduction minimale d'un graphe a une reunion de cliques. Discret. Math. 10(1): 173-179 (1974) - 1973
- [j5]Ioan Tomescu
A Combinatorial Algorithm for Solving Covering Problems. IEEE Trans. Computers 22(2): 218-220 (1973) - 1972
- [j4]Ioan Tomescu
Le nombre maximal de 3-colorations d'un graphe connexe. Discret. Math. 1(4): 351-356 (1972) - [j3]Ioan Tomescu
A Method for Minimizing the Number of States for a Restricted Class of Incompletely Specified Sequential Machines. Math. Syst. Theory 6(1): 1-2 (1972) - [j2]Ioan Tomescu
A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine. IEEE Trans. Computers 21(5): 502-503 (1972) - 1970
- [j1]Ioan Tomescu
A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching Network. IEEE Trans. Computers 19(1): 78-79 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: