Martina Mockovčiaková

University of West Bohemia — Czech Republic

Computer Science · Physical Sciences

4h-index73citations19works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(13), Graph Labeling and Dimension Problems(9), Graph theory and applications(6), Limits and Structures in Graph Theory(5), Coding theory and cryptography(3)

Publications19 total

Revisiting semistrong edge‐coloring of graphs
Journal of Graph Theory·2023· 5 citedOpen Access
Revisiting Semistrong Edge-Coloring of Graphs
arXiv (Cornell University)·2022Open Access
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles
Journal of Graph Theory·2021Open Access
Star edge-coloring of square grids
Applied Mathematics and Computation·2020· 1 citedOpen Access
On non-repetitive sequences of arithmetic progressions: The cases <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e202" altimg="si18.svg"><mml:mrow><mml:mi>k</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">∈</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo>,</mml:mo><mml:mn>7</mml:mn><mml:mo>,</mml:mo><mml:mn>8</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math>
Discrete Applied Mathematics·2019Open Access
At least half of the leapfrog fullerene graphs have exponentially many\n Hamilton cycles
arXiv (Cornell University)·2019Open Access
Incidence coloring-cold cases
Discussiones Mathematicae Graph Theory·2018· 3 citedOpen Access
Incidence coloring of graphs with bounded maximum average degree
SPIRE - Sciences Po Institutional REpository·2018
Incidence coloring of some special classes of graphs
SPIRE - Sciences Po Institutional REpository·2018
On a star chromatic index of subcubic graphs
Electronic Notes in Discrete Mathematics·2017· 5 cited
On a conjecture on k-Thue sequences
SPIRE - Sciences Po Institutional REpository·2016
On a Generalization of Thue Sequences
The Electronic Journal of Combinatorics·2015· 3 citedOpen Access
Star Edge Coloring of Some Classes of Graphs
Journal of Graph Theory·2015· 43 citedOpen Access
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:mi>ℓ</mml:mi></mml:math>-facial edge colorings of graphs
Discrete Applied Mathematics·2014· 8 citedOpen Access
Note on coloring of double disk graphs
Journal of Global Optimization·2014
Strong edge coloring of subcubic bipartite graphs
arXiv (Cornell University)·2013Open Access
Strong edge coloring of subcubic bipartite graphs
arXiv (Cornell University)·2013Open Access
Arbitrarily large difference between <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si10.gif" display="inline" overflow="scroll"> <mml:mi>d</mml:mi> </mml:math> -strong chromatic index and its trivial lower bound
Discrete Mathematics·2013· 4 cited
Notes on topological indices of graph and its complement
Opuscula Mathematica·2012· 1 citedOpen Access

Frequent Co-authors

Roman Soták(16), Borut Lužar(12), František Kardoš(5), Riste Škrekovski(4), Mária Maceková(3), Jaka Kranjc(2), Pascal Ochem(2), Alexandre Pinlou(2), Éric Sopena(2), L’udmila Bezegová(1), Peter Šugerek(1), Éric Sopena(1), Přemysl Holub(1), Erika Mihaliková(1), Tomáš Madaras(1)