![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Jaroslav Ivanco
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j23]Jaroslav Ivanco, Alfred Onderko
:
On Mf-edge colorings of graphs. Discuss. Math. Graph Theory 42(4): 1075-1088 (2022) - 2020
- [j22]Jaroslav Ivanco:
Gradual supermagic graphs. AKCE Int. J. Graphs Comb. 17(1): 220-228 (2020) - 2017
- [j21]Jaroslav Ivanco:
On k-total edge product cordial graphs. Australas. J Comb. 67: 476-485 (2017) - 2016
- [j20]Jaroslav Ivanco:
A class of totally antimagic total graphs. Australas. J Comb. 65: 170-182 (2016) - [j19]Július Czap
, Jaroslav Ivanco, Peter Sugerek:
M2-edge colorings of cacti and graph joins. Discuss. Math. Graph Theory 36(1): 59-69 (2016) - [j18]Jaroslav Ivanco:
Supermagic generalized double graphs. Discuss. Math. Graph Theory 36(1): 211-225 (2016) - 2014
- [j17]Jaroslav Ivanco, Tatiana Polláková:
Supermagic graphs having a saturated vertex. Discuss. Math. Graph Theory 34(1): 75-84 (2014) - 2013
- [j16]L'udmila Bezegová, Jaroslav Ivanco:
Number of edges in degree-magic graphs. Discret. Math. 313(11): 1349-1357 (2013) - 2012
- [j15]L'udmila Bezegová, Jaroslav Ivanco:
A characterization of complete tripartite degree-magic graphs. Discuss. Math. Graph Theory 32(2): 243-253 (2012) - 2011
- [j14]L'udmila Bezegová, Jaroslav Ivanco:
On conservative and supermagic graphs. Discret. Math. 311(21): 2428-2436 (2011) - 2010
- [j13]L'udmila Bezegová, Jaroslav Ivanco:
An extension of regular supermagic graphs. Discret. Math. 310(24): 3571-3578 (2010) - [j12]Jaroslav Ivanco:
Decompositions of multigraphs into parts with the same size. Discuss. Math. Graph Theory 30(2): 335-347 (2010) - 2007
- [j11]Jaroslav Ivanco, Andrea Semanicová:
Some constructions of supermagic non-regular graphs. Australas. J Comb. 38: 127-140 (2007) - [j10]Jaroslav Ivanco:
Magic and supermagic dense bipartite graphs. Discuss. Math. Graph Theory 27(3): 583-591 (2007) - 2006
- [j9]Jaroslav Ivanco, Stanislav Jendrol':
Total edge irregularity strength of trees. Discuss. Math. Graph Theory 26(3): 449-456 (2006) - [j8]Svetlana Drajnová, Jaroslav Ivanco, Andrea Semanicová
:
Numbers of edges in supermagic graphs. J. Graph Theory 52(1): 15-26 (2006) - 2002
- [j7]Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien:
Decompositions of multigraphs into parts with two edges. Discuss. Math. Graph Theory 22(1): 113-121 (2002) - 1999
- [j6]Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien:
Decomposition of Multigraphs into Isomorphic Graphs with Two Edges. Ars Comb. 51 (1999) - [j5]Jozef Bucko, Jaroslav Ivanco:
Uniquely partitionable planar graphs with respect to properties having a forbidden tree. Discuss. Math. Graph Theory 19(1): 71-78 (1999) - 1997
- [j4]Piotr Borowiecki
, Jaroslav Ivanco:
P-bipartitions of minor hereditary properties. Discuss. Math. Graph Theory 17(1): 89-93 (1997) - 1995
- [j3]Mieczyslaw Borowiecki, Jaroslav Ivanco, Peter Mihók, Gabriel Semanisin
:
Sequences realizable by maximal k-degenerate graphs. J. Graph Theory 19(1): 117-124 (1995) - 1994
- [j2]Matús Harminc, Jaroslav Ivanco:
Note on eccentricities in tournaments. Graphs Comb. 10(2-4): 231-234 (1994) - 1991
- [j1]Jaroslav Ivanco:
An interpolation theorem for partitions which are indivisible with respect to cohereditary properties. J. Comb. Theory B 52(1): 97-101 (1991)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint