Andrej Taranenko

17 papers Journal 17
YearRankTypeTitle / Venue / Authors
2025 J jnl
Graphs with span 1 and shortest optimal walks.
Appl. Math. Comput.
Tanja Dravec, Mirjana Mikalacki, Andrej Taranenko
2024 J jnl
The strong vertex span of trees.
CoRR
Mateja Grasic, Chris Mouron, Andrej Taranenko
2023 J jnl
Daisy Hamming graphs.
Discuss. Math. Graph Theory
Tanja Dravec, Andrej Taranenko
2023 J jnl
Span of a Graph: Keeping the Safety Distance.
Discret. Math. Theor. Comput. Sci.
Iztok Banic, Andrej Taranenko
2020 J jnl
Daisy cubes: A characterization and a generalization.
Eur. J. Comb.
Andrej Taranenko
2019 J jnl
Daisy cubes: a characterization and a generalization.
CoRR
Andrej Taranenko
2019 J jnl
On graphs with the maximum edge metric dimension.
Discret. Appl. Math.
Enqiang Zhu, Andrej Taranenko, Zehui Shao, Jin Xu
2018 J jnl
A note on the Thue chromatic number of lexicographic produts of graphs.
Discuss. Math. Graph Theory
Erika Fecková Skrabul'áková, Iztok Peterin, Jens Schreyer, Andrej Taranenko
2017 J jnl
Mixed metric dimension of graphs.
Appl. Math. Comput.
Aleksander Kelenc, Dorota Kuziak, Andrej Taranenko, Ismael González Yero
2014 J jnl
The partition dimension of strong product graphs and Cartesian product graphs.
Discret. Math.
Ismael González Yero, Marko Jakovac, Dorota Kuziak, Andrej Taranenko
2013 J jnl
A new characterization and a recognition algorithm of Lucas cubes.
Discret. Math. Theor. Comput. Sci.
Andrej Taranenko
2013 J jnl
On the k-path vertex cover of some graph products.
Discret. Math.
Marko Jakovac, Andrej Taranenko
2013 J jnl
On the vertex
Discret. Appl. Math.
Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko
2012 J jnl
1-factors and characterization of reducible faces of plane elementary bipartite graphs.
Discuss. Math. Graph Theory
Andrej Taranenko, Aleksander Vesel
2010 J jnl
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems.
Comput. Math. Appl.
Sandi Klavzar, Khaled Salem, Andrej Taranenko
2008 J jnl
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs.
Discret. Appl. Math.
Andrej Taranenko, Aleksander Vesel
2007 J jnl
Fast Recognition of Fibonacci Cubes.
Algorithmica
Andrej Taranenko, Aleksander Vesel