Roman Cada

most citedInduced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs

7 citations · 7 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2014★ 7 cited

Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs

Roman Čada, Binlong Li, Bo Ning +1

A graph is called \emph{claw-free} if it contains no induced subgraph isomorphic to $K_{1, 3}$ . Matthews and Sumner proved that a 2-connected claw-free graph $G$ is hamiltonian if e…

math.CO2012

Radio Labelings of Distance Graphs

R. Čada, J. Ekstein, P. Holub +1

A radio $k$ -labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that $∣ c (x) - c (y) ∣ \geq k + 1 - d (x, y),$ for any two vertic…