The following pages link to Andrej Taranenko (Q397143):
Displayed 21 items.
- The partition dimension of strong product graphs and Cartesian product graphs (Q397144) (← links)
- Measuring closeness of graphs -- the Hausdorff distance (Q506185) (← links)
- Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs (Q944724) (← links)
- Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems (Q980378) (← links)
- A note on the thue chromatic number of lexicographic products of graphs (Q1649901) (← links)
- On graphs with the maximum edge metric dimension (Q1730253) (← links)
- Mixed metric dimension of graphs (Q1740116) (← links)
- On the \(k\)-path vertex cover of some graph products (Q1759813) (← links)
- Daisy cubes: a characterization and a generalization (Q2297914) (← links)
- On the vertex \(k\)-path cover (Q2446837) (← links)
- Fast recognition of Fibonacci cubes (Q2461540) (← links)
- An elitist genetic algorithm for the maximum independent set problem (Q2768237) (← links)
- (Q2856707) (← links)
- (Q2943941) (← links)
- (Q3649258) (← links)
- 1-factors and characterization of reducible faces of plane elementary bipartite graphs (Q4647870) (← links)
- (Q5279141) (← links)
- (Q5747406) (← links)
- Span of a Graph: Keeping the Safety Distance (Q6131784) (← links)
- Daisy Hamming graphs (Q6341522) (← links)
- Irregularity of expansions and Pell graphs (Q6362863) (← links)