3 papers
math.CO2026
Recognizability of Being Point Determining
M. H. Shirdareh Haghighi, A. Namazi, Z Rahimi +1
A graph is point determining, if no two vertices have the same neighborhoods. In this paper, we show that this property is recognizable from the deck of cards of a graph.
math.CO2026
Characterization of graphs where for some graph
Zahra Rahimi, M. H. Shirdareh Haghighi, Asma Namazi
A full-homomorphism from a graph to a graph is a function on vertex sets that preserves adjacency and non-adjacency of vertices. A graph is called a minimal -obstruc…
math.CO2020
Long monochromatic even cycles in 3-edge-coloured graphs of large minimum degree
Tomasz Łuczak, Zahra Rahimi
We show that for every , there exists such that for every even , , and every graph with vertices and minimum degree at least , each…