Florian Lehner

works on

cayley graphs 1 finite groups 1 graph theory 1 group order pqrs 1 hamiltonian cycles 1

From the 1 of 3 linked papers with an AI index.

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Cayley Graphs Of Order $pq r s$ Are Hamiltonian

Florian Lehner, Farzad Maghsoudi, Bobby Miraftab

The paper proves that every connected Cayley graph of a finite group whose order is the product of four distinct primes (pqrs) contains a Hamiltonian cycle.

math.CO2024

Hamiltonicity of Transitive Graphs Whose Automorphism Group Has $Z_{p}$ as Commutator Subgroups

Florian Lehner, Farzad Maghsoudi, Babak Miraftab

In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this…

math.CO2024

Basis number of bounded genus graphs

Florian Lehner, Babak Miraftab

The basis number of a graph $G$ is the smallest integer $k$ such that $G$ admits a basis $B$ for its cycle space, where each edge of $G$ belongs to at most $k$ members of $B$ . In t…

Cayley Graphs Of Order pqrs Are Hamiltonian

Hamiltonicity of Transitive Graphs Whose Automorphism Group Has Zp​ as Commutator Subgroups

Basis number of bounded genus graphs

Cayley Graphs Of Order $pq r s$ Are Hamiltonian

Hamiltonicity of Transitive Graphs Whose Automorphism Group Has $Z_{p}$ as Commutator Subgroups