default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJúlius Czap
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j34]Július Czap
, Stanislav Jendrol', Tomás Madaras:
Facial Visibility in Edge Colored Plane Graphs. Graphs Comb. 38(1): 4 (2022)- 2021
- [j33]Július Czap, Mirko Hornák, Stanislav Jendrol':
A survey on the cyclic coloring and its relaxations. Discuss. Math. Graph Theory 41(1): 5-38 (2021) - [j32]Július Czap, Igor Fabrici, Stanislav Jendrol':
Colorings of plane graphs without long monochromatic facial paths. Discuss. Math. Graph Theory 41(3): 801-808 (2021) - [j31]Július Czap, Peter Sugerek:
Odd facial colorings of acyclic plane graphs. Electron. J. Graph Theory Appl. 9(2): 347-356 (2021) - 2020
- [j30]Július Czap, Stanislav Jendrol', Juraj Valiska:
Edge-coloring of plane multigraphs with many colors on facial cycles. Discret. Appl. Math. 282: 80-85 (2020)
2010 – 2019
- 2019
- [j29]Július Czap, Stanislav Jendrol', Peter Sugerek, Juraj Valiska:
Facial packing vertex-coloring of subdivided plane graphs. Discret. Appl. Math. 257: 95-100 (2019) - [j28]Július Czap, Stanislav Jendrol', Peter Sugerek, Juraj Valiska:
Facial [r.s, t]-colorings of plane graphs. Discuss. Math. Graph Theory 39(3): 629-645 (2019) - [j27]Július Czap, Stanislav Jendrol':
Facial Colorings of Plane Graphs. J. Interconnect. Networks 19(1): 1940003:1-1940003:20 (2019) - 2018
- [j26]Július Czap, Stanislav Jendrol', Juraj Valiska:
Facial L(2, 1)-edge-labelings of trees. Discret. Appl. Math. 247: 357-366 (2018) - [j25]Július Czap, Stanislav Jendrol', Juraj Valiska:
Conflict -free connections of graphs. Discuss. Math. Graph Theory 38(4): 911-920 (2018) - 2017
- [j24]Július Czap, Stanislav Jendrol', Roman Soták:
Facial anagram-free edge-coloring of plane graphs. Discret. Appl. Math. 230: 151-155 (2017) - [j23]Július Czap, Stanislav Jendrol':
Facially-constrained colorings of plane graphs: A survey. Discret. Math. 340(11): 2691-2703 (2017) - [j22]Július Czap, Stanislav Jendrol', Juraj Valiska:
WORM colorings of planar graphs. Discuss. Math. Graph Theory 37(2): 353-368 (2017) - 2016
- [j21]Július Czap, Stanislav Jendrol':
Facial packing edge-coloring of plane graphs. Discret. Appl. Math. 213: 71-75 (2016) - [j20]Július Czap, Jaroslav Ivanco, Peter Sugerek:
M2-edge colorings of cacti and graph joins. Discuss. Math. Graph Theory 36(1): 59-69 (2016) - [j19]Július Czap, Jakub Przybylo, Erika Skrabul'áková:
On an extremal problem in the class of bipartite 1-planar graphs. Discuss. Math. Graph Theory 36(1): 141-151 (2016) - 2015
- [j18]Július Czap:
Edge looseness of plane graphs. Ars Math. Contemp. 9(2): 279-286 (2015) - [j17]Július Czap, Stanislav Jendrol':
Facial edge ranking of plane graphs. Discret. Appl. Math. 194: 60-64 (2015) - [j16]Tomás Bálint, Július Czap:
Facial Parity 9-Edge-Coloring of Outerplane Graphs. Graphs Comb. 31(5): 1177-1187 (2015) - 2014
- [j15]Július Czap, Jochen Harant, Dávid Hudák:
An upper bound on the sum of powers of the degrees of simple 1-planar graphs. Discret. Appl. Math. 165: 146-151 (2014) - 2013
- [j14]Július Czap, Dávid Hudák:
On Drawings and Decompositions of 1-Planar Graphs. Electron. J. Comb. 20(2): 54 (2013) - [j13]Július Czap, Peter Mihók:
Fractional Q-coloring of graphs. Discuss. Math. Graph Theory 33(3): 509-519 (2013) - [j12]Július Czap, Zsolt Tuza:
Decompositions of plane graphs under parity constrains given by faces. Discuss. Math. Graph Theory 33(3): 521-530 (2013) - [j11]Július Czap:
A note on total colorings of 1-planar graphs. Inf. Process. Lett. 113(14-16): 516-517 (2013) - [j10]János Barát, Július Czap:
Facial Nonrepetitive Vertex Coloring of Plane Graphs. J. Graph Theory 74(1): 115-121 (2013) - 2012
- [j9]Július Czap:
Facial parity edge coloring of outerplane graphs. Ars Math. Contemp. 5(2): 289-293 (2012) - [j8]Július Czap, Dávid Hudák:
1-planarity of complete multipartite graphs. Discret. Appl. Math. 160(4-5): 505-512 (2012) - [j7]Július Czap, Stanislav Jendrol', Frantisek Kardos, Roman Soták:
Facial parity edge colouring of plane pseudographs. Discret. Math. 312(17): 2735-2740 (2012) - 2011
- [j6]Július Czap, Stanislav Jendrol', Frantisek Kardos:
Facial parity edge colouring. Ars Math. Contemp. 4(2): 255-269 (2011) - [j5]Július Czap, Stanislav Jendrol', Margit Voigt:
Parity vertex colouring of plane graphs. Discret. Math. 311(6): 512-520 (2011) - [j4]Július Czap:
Parity vertex coloring of outerplane graphs. Discret. Math. 311(21): 2570-2573 (2011) - [j3]Július Czap, Stanislav Jendrol', Frantisek Kardos:
On strong parity chromatic number. Discuss. Math. Graph Theory 31(3): 587-600 (2011) - [j2]Július Czap, Stanislav Jendrol', Frantisek Kardos, Jozef Miskuf:
Looseness of Plane Graphs. Graphs Comb. 27(1): 73-85 (2011)
2000 – 2009
- 2009
- [j1]Július Czap, Stanislav Jendrol':
Colouring vertices of plane graphs under restrictions given by faces. Discuss. Math. Graph Theory 29(3): 521-543 (2009)
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-10-07 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
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:
