Aleksander Vesel

From MaRDI portal
Person:233536

Available identifiers

zbMath Open vesel.aleksanderWikidataQ48075985 ScholiaQ48075985MaRDI QIDQ233536

List of research outcomes





PublicationDate of PublicationType
Mutual-visibility sets in Cartesian products of paths and cycles2024-03-14Paper
Binary Coding of Resonance Graphs of Catacondensed Polyhexes2023-07-10Paper
General position sets in two families of Cartesian product graphs2023-05-24Paper
New results on radio \(k\)-labelings of distance graphs2022-08-04Paper
\(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles2022-03-07Paper
Efficient proper embedding of a daisy cube2022-01-05Paper
Optimizing distance constraints frequency assignment with relaxation2021-07-27Paper
On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs2021-04-15Paper
Corrigendum to: ``Modeling the packing coloring problem of graphs2020-01-27Paper
Modeling the packing coloring problem of graphs2019-12-03Paper
Packing coloring of generalized Sierpinski graphs2019-05-23Paper
A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices2019-03-11Paper
Cube-complements of generalized Fibonacci cubes2019-02-20Paper
Frequency assignment problem in networks with limited spectrum2018-10-09Paper
The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles2018-07-24Paper
\((d, n)\)-packing colorings of infinite lattices2018-02-22Paper
Graceful labelings of the generalized Petersen graphs2017-12-20Paper
Regular coronoids and 4-tilings2017-09-12Paper
https://portal.mardi4nfdi.de/entity/Q29753062017-04-11Paper
Linear recognition of generalized Fibonacci cubes \(Q_h(111)\)2016-10-21Paper
\(L(3,2,1)\)-labeling of triangular and toroidal grids2016-07-04Paper
https://portal.mardi4nfdi.de/entity/Q29439422015-09-07Paper
Linear recognition and embedding of Fibonacci cubes2015-06-25Paper
Equal opportunity networks, distance-balanced graphs, and Wiener game2015-04-09Paper
Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs2014-04-22Paper
A note on the independence number of strong products of odd cycles.2013-09-09Paper
A note on the chromatic number of the square of the Cartesian product of two cycles2013-04-11Paper
1-factors and characterization of reducible faces of plane elementary bipartite graphs2012-11-08Paper
https://portal.mardi4nfdi.de/entity/Q30750542011-02-10Paper
The Clar formulas of a benzenoid system and the resonance graph2010-04-28Paper
https://portal.mardi4nfdi.de/entity/Q36550782010-01-12Paper
\(L(2,1)\)-labeling of strong products of cycles2009-12-04Paper
https://portal.mardi4nfdi.de/entity/Q36492582009-12-03Paper
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs2008-09-10Paper
https://portal.mardi4nfdi.de/entity/Q54543982008-03-28Paper
Fast recognition of Fibonacci cubes2007-11-28Paper
https://portal.mardi4nfdi.de/entity/Q33690562006-02-13Paper
Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles2005-12-27Paper
https://portal.mardi4nfdi.de/entity/Q57148882005-12-16Paper
\(L(2,1)\)-labeling of direct product of paths and cycles2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q48158352004-09-08Paper
Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers2003-09-09Paper
Improved lower bound on the Shannon capacity of \(C_7\)2003-06-24Paper
Recognizing pseudo-median graphs2002-08-07Paper
An elitist genetic algorithm for the maximum independent set problem.2002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q45221082001-08-16Paper
A characterization of halved cubes2001-05-30Paper
On the linearK-arboricity of cubic graphs2000-12-21Paper
The independence number of the strong product of cycles1999-11-29Paper
The independence number of the strong product of odd cycles1998-08-11Paper
Recognizing halved cubes in a constant time per edge1996-07-17Paper
Variety of mutual-visibility problems in hypercubesN/APaper

Research outcomes over time

This page was built for person: Aleksander Vesel