Andrej Taranenko

Orcid: 0000-0002-2438-0496

According to our database1, Andrej Taranenko authored at least 14 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Span of a Graph: Keeping the Safety Distance.
Discret. Math. Theor. Comput. Sci., 2023

Daisy Hamming graphs.
Discuss. Math. Graph Theory, 2023

2020
Daisy cubes: A characterization and a generalization.
Eur. J. Comb., 2020

2019
On graphs with the maximum edge metric dimension.
Discret. Appl. Math., 2019

2018
A note on the Thue chromatic number of lexicographic produts of graphs.
Discuss. Math. Graph Theory, 2018

2017
Mixed metric dimension of graphs.
Appl. Math. Comput., 2017

2014
The partition dimension of strong product graphs and Cartesian product graphs.
Discret. Math., 2014

2013
A new characterization and a recognition algorithm of Lucas cubes.
Discret. Math. Theor. Comput. Sci., 2013

On the k-path vertex cover of some graph products.
Discret. Math., 2013

On the vertex <i>k</i>k-path cover.
Discret. Appl. Math., 2013

2012
1-factors and characterization of reducible faces of plane elementary bipartite graphs.
Discuss. Math. Graph Theory, 2012

2010
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems.
Comput. Math. Appl., 2010

2008
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs.
Discret. Appl. Math., 2008

2007
Fast Recognition of Fibonacci Cubes.
Algorithmica, 2007


  Loading...