default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJán Mazák
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Dusan Bernát, Ján Mazák:
Circular Chromatic Index of Small Snarks. ITAT 2024: 150-155- 2022
- [j16]Ján Mazák
, Jozef Rajník, Martin Skoviera:
Morphology of Small Snarks. Electron. J. Comb. 29(4) (2022) - [c2]Ján Mazák, Jozef Rajník, Martin Skoviera:
Structural Analysis of Cubic Graphs based on 5-cycle Clusters. ITAT 2022: 214-222 - 2021
- [j15]Edita Mácajová, Ján Mazák:
Corrigendum to "On even cycle decompositions of 4-regular line graphs" [Discrete Math. 313 (17) (2013) 1697-1699]. Discret. Math. 344(2): 112175 (2021) - [i6]Ján Mazák, Jozef Rajník, Martin Skoviera:
Morphology of small snarks. CoRR abs/2112.04335 (2021)
2010 – 2019
- 2018
- [j14]Robert Lukotka, Ján Mazák:
Simple cubic graphs with no short traveling salesman tour. Discret. Appl. Math. 244: 218-222 (2018) - [j13]Robert Lukot'ka, Ján Mazák:
Weak oddness as an approximation of oddness and resistance in cubic graphs. Discret. Appl. Math. 244: 223-226 (2018) - 2017
- [i5]Robert Lukotka, Ján Mazák:
Simple cubic graphs with no short traveling salesman tour. CoRR abs/1712.10167 (2017) - 2016
- [j12]Edita Mácajová, Ján Mazák:
Cubic Graphs with Large Circumference Deficit. J. Graph Theory 82(4): 433-440 (2016) - [i4]Robert Lukotka, Ján Mazák:
Weak oddness as an approximation of oddness and resistance in cubic graphs. CoRR abs/1602.02949 (2016) - 2015
- [j11]Robert Lukotka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Small Snarks with Large Oddness. Electron. J. Comb. 22(1): 1 (2015) - [j10]Robert Lukot'ka, Ján Mazák, Xuding Zhu:
Maximum 4-Degenerate Subgraph of a Planar Graph. Electron. J. Comb. 22(1): 1 (2015) - 2013
- [j9]Martin Macaj, Ján Mazák:
Asymptotic Lower Bounds on Circular Chromatic Index of Snarks. Electron. J. Comb. 20(2): 2 (2013) - [j8]Stefan Gyürki, Ján Mazák:
An efficient algorithm for testing goal-minimality of graphs. Discret. Appl. Math. 161(10-11): 1632-1634 (2013) - [j7]Edita Mácajová, Ján Mazák:
On even cycle decompositions of 4-regular line graphs. Discret. Math. 313(17): 1697-1699 (2013) - [i3]Robert Lukotka, Ján Mazák, Xuding Zhu:
Maximum 4-degenerate subgraph of a planar graph. CoRR abs/1305.6195 (2013) - [i2]Edita Mácajová, Ján Mazák:
Cubic graphs with large circumference deficit. CoRR abs/1310.1042 (2013) - 2012
- [j6]Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Circuits of length 5 in 2-factors of cubic graphs. Discret. Math. 312(14): 2131-2134 (2012) - [j5]Lars Døvling Andersen, Edita Mácajová, Ján Mazák:
Optimal acyclic edge-coloring of cubic graphs. J. Graph Theory 71(4): 353-364 (2012) - [i1]Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Small snarks with large oddness. CoRR abs/1212.3641 (2012) - 2011
- [c1]Edita Mácajová, Ján Mazák:
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs. FAW-AAIM 2011: 136-146 - 2010
- [j4]Daniel Král', Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni:
Circular edge-colorings of cubic graphs with girth six. J. Comb. Theory B 100(4): 351-358 (2010) - [j3]Robert Lukot'ka, Ján Mazák:
Cubic Graphs with Given Circular Chromatic Index. SIAM J. Discret. Math. 24(3): 1091-1103 (2010)
2000 – 2009
- 2009
- [j2]Daniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni:
Circular edge-colorings of cubic graphs with girth six. Electron. Notes Discret. Math. 34: 525-529 (2009) - 2008
- [j1]Ján Mazák:
Circular chromatic index of type 1 Blanusa snarks. J. Graph Theory 59(2): 89-96 (2008)
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-25 20:12 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:
