15 citations · 73 across the 38 of their papers we have counts for
5 papers · 1 filter
Complete Mappings of Semigroups
João Araújo, Wolfram Bentz, Peter J. Cameron +2
A complete mapping of a semigroup is a bijection such that the map defined by is also a bijection. Equivalently, it determines…
Optimal tree-decompositions with bags of bounded pathwidth
Kevin Hendrey, Robert Hickingbotham, Jędrzej Hodor +1
We show that every planar graph has a tree-decomposition with optimal width such that the subgraph induced by each bag has pathwidth at most 3. This bound is best possible, and for…
An Erdős-Pósa theorem for cycles and faces of distinct lengths
J. Pascal Gollin, Maximilian Gorsky, Meike Hatzel +6
We show that for every , every graph contains vertex-disjoint cycles of different lengths, or there exists a set with $|X| \in \mathcal…
The Erdős-Pósa property for prime-length cycles fails (and beyond)
Maximilian Gorsky, Kevin Hendrey, Tony Huynh
We prove that for every , prime-length cycles do not have the -integral Erdős-Pósa property, even when restricted to planar graphs. We in fact prove…
Long cycles in vertex transitive digraphs
Matija Bucić, Kevin Hendrey, Bojan Mohar +2
One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this f…