Irena Hrastnik Ladinek

collaborators

4 papers

math.CO2026

Hamiltonicity of Cartesian products of trees with odd paths

Irena Hrastnik Ladinek, Tjasa Paj Erker, Simon Spacapan

A ${P_{2}, P_{3}}$ -factor in a graph $G$ is a factor of $G$ in which every component is a path on two or three vertices. Let $T □ P_{n}$ be the Cartesian product of a tree $T$ and a p…

math.CO2024

Optimal $L (2, 1)$ -labeling of certain strong graph bundles cycles over cycles

Irena Hrastnik Ladinek

An $L (2, 1)$ -labeling of a graph $G = (V, E)$ is a function $f$ from the vertex set $V (G)$ to the set of nonnegative integers such that the labels on adjacent vertices differ by at lea…

math.CO2024

Optimal $L (d, 1)$ -labeling of certain direct graph bundles cycles over cycles and Cartesian graph bundles cycles over cycles

Irena Hrastnik Ladinek

An $L (d, 1)$ -labeling of a graph $G$ is an assignment of nonnegative integers to the vertices such that adjacent vertices receive labels that differ by at least $d$ and those at a d…

math.CO2024

Hamiltonicity of Cartesian products of graphs

Irena Hrastnik Ladinek, Žana Kovijanić Vukićević, Tjaša Paj Erker +1

A path factor in a graph $G$ is a factor of $G$ in which every component is a path on at least two vertices. Let $T □ P_{n}$ be the Cartesian product of a tree $T$ and a path on $n…

Hamiltonicity of Cartesian products of trees with odd paths

Optimal L(2,1)-labeling of certain strong graph bundles cycles over cycles

Optimal L(d,1)-labeling of certain direct graph bundles cycles over cycles and Cartesian graph bundles cycles over cycles

Hamiltonicity of Cartesian products of graphs

Optimal $L (2, 1)$ -labeling of certain strong graph bundles cycles over cycles

Optimal $L (d, 1)$ -labeling of certain direct graph bundles cycles over cycles and Cartesian graph bundles cycles over cycles