2 papers
math.CO2020
A Highly Symmetric Hamilton Decomposition for Hypercubes
Farid Bouya, Ebadollah S. Mahmoodian, Modjtaba Shokrian Zini +1
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimens…
math.CO2019
Seymour's second-neighborhood conjecture from a different perspective
Farid Bouya, Bogdan Oporowski
Seymour's Second-Neighborhood Conjecture states that every directed graph whose underlying graph is simple has at least one vertex such that the number of vertices of out-dista…