24 citations · 48 across the 15 of their papers we have counts for
15 papers · 1 filter
About the second neighborhood conjecture for tournaments missing two stars or disjoint paths
Moussa Daamouch, Salman Ghazal, Darine Al-Mniny
Seymour's Second Neighborhood Conjecture (SSNC) asserts that every oriented finite simple graph (without digons) has a vertex whose second out-neighborhood is at least as large as…
Forbidding Couples of Tournaments and the Erdös-Hajnal Conjecture
Salman Ghazal, Soukaina Zayat
A celebrated unresolved conjecture of Erdös and Hajnal states that for every undirected graph there exists such that every undirected graph on vertices that…
The Second Neighborhood Conjecture for Oriented Graphs Missing chair and co-chair-Free Graph
Darine Al Mniny, Salman Ghazal
Seymour's Second Neighborhood Conjecture (SNC) asserts that every oriented graph has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. In th…
Remarks on the subdivisions of bispindles and two-blocks cycles in highly chromatic digraphs
Darine Al Mniny, Salman Ghazal
A -bispindle is the union of two -dipaths of respective lengths and , and one -dipath of length , all these dipaths being pairwise i…
About the Erdös-Hajnal conjecture for seven-vertex tournaments
Soukaina Zayat, Salman Ghazal
A celebrated unresolved conjecture of Erdös and Hajnal states that for every undirected graph there exists such that every undirected graph on vertices that…
Tournaments and the Erdös-Hajnal Conjecture
Soukaina Zayat, Salman Ghazal
The celebrated Erdös-Hajnal conjecture states that for every undirected graph there exists such that every undirected graph on vertices that does not contain…
Erdös-Hajnal Conjecture for New Infinite Families of Tournaments
Soukaina Zayat, Salman Ghazal
Erdös-Hajnal conjecture states that for every undirected graph there exists such that every undirected graph on vertices that does not contain as an indu…
The structure of graphs with forbidden , , , chair and co-chair
Salman Ghazal
We find the structure of graphs that have no , , , chair and co-chair as induced subgraphs.
The Second Neighborhood Conjecture for Oriented Graphs Missing Combs
Salman Ghazal
Seymour's Second Neighborhood Conjecture asserts that every oriented graph has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. Combs are t…
A Remark on the Second Neighborhood Problem
Salman Ghazal
Seymour's second neighborhood conjecture states that every simple digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborh…
Erratum to: "Remarks on the second neighborhood problem"
Salman Ghazal
We prove that the proof of existence of weighted local median order of weighted tournaments is wrong and that the proof of the correct statement which asserts that every digraph ob…
New Proofs of Königs Theorem
Salman Ghazal
We introduce four new elementary short proofs of the famous König's theorem which characterizes bipartite graphs by absence of odd cycles.
A contribution to the second neighborhood problem
Salman Ghazal
Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. I…
Seymour's second neighborhood conjecture for tournaments missing a generalized star
Salman Ghazal
Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. W…
About The Second Neighborhood Problem in Tournaments Missing Disjoint Stars
Salman Ghazal
We prove Seymour's Second Neighborhood Conjecture when the missing graph is disjoint stars under some conditions. Weaker conditions are required when n=2 or 3. In some cases, we ex…