Ján Mazák

Orcid: 0000-0002-6498-9984

According to our database1, Ján Mazák authored at least 17 papers between 2008 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Morphology of Small Snarks.
Electron. J. Comb., 2022

Structural Analysis of Cubic Graphs based on 5-cycle Clusters.
Proceedings of the 22nd Conference Information Technologies, 2022

2021
Corrigendum to "On even cycle decompositions of 4-regular line graphs" [Discrete Math. 313 (17) (2013) 1697-1699].
Discret. Math., 2021

2018
Weak oddness as an approximation of oddness and resistance in cubic graphs.
Discret. Appl. Math., 2018

Simple cubic graphs with no short traveling salesman tour.
Discret. Appl. Math., 2018

2016
Cubic Graphs with Large Circumference Deficit.
J. Graph Theory, 2016

2015
Maximum 4-Degenerate Subgraph of a Planar Graph.
Electron. J. Comb., 2015

Small Snarks with Large Oddness.
Electron. J. Comb., 2015

2013
On even cycle decompositions of 4-regular line graphs.
Discret. Math., 2013

An efficient algorithm for testing goal-minimality of graphs.
Discret. Appl. Math., 2013

Asymptotic Lower Bounds on Circular Chromatic Index of Snarks.
Electron. J. Comb., 2013

2012
Optimal acyclic edge-coloring of cubic graphs.
J. Graph Theory, 2012

Circuits of length 5 in 2-factors of cubic graphs.
Discret. Math., 2012

2011
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Cubic Graphs with Given Circular Chromatic Index.
SIAM J. Discret. Math., 2010

2009
Circular edge-colorings of cubic graphs with girth six.
Electron. Notes Discret. Math., 2009

2008
Circular chromatic index of type 1 Blanusa snarks.
J. Graph Theory, 2008


  Loading...