The following pages link to Nicolas Lichiardopol (Q244952):
Displaying 30 items.
- Vertex-disjoint subgraphs with high degree sums (Q322265) (← links)
- Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two (Q389212) (← links)
- New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth (Q400363) (← links)
- Vertex-disjoint cycles in regular tournaments (Q427838) (← links)
- Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz (Q666527) (← links)
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree (Q708429) (← links)
- A new bound for a particular case of the Caccetta-Häggkvist conjecture (Q712265) (← links)
- A linear bound towards the traceability conjecture (Q895060) (← links)
- Triangle-free oriented graphs and the traceability conjecture (Q898141) (← links)
- On Robin's criterion for the Riemann hypothesis (Q933196) (← links)
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967) (← links)
- Disjoint cycles of different lengths in graphs and digraphs (Q1684653) (← links)
- On the existence of vertex-disjoint subgraphs with high degree sum (Q1693134) (← links)
- Independence number of iterated line digraphs (Q1779497) (← links)
- Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph (Q1827675) (← links)
- Broadcast time and connectivity (Q1887074) (← links)
- New Ore's type results on hamiltonicity and existence of paths of given length in graphs (Q1938881) (← links)
- Distance domination in graphs with given minimum and maximum degree (Q2410104) (← links)
- Cycles in a tournament with pairwise zero, one or two given vertices in common (Q2470442) (← links)
- Independence number of de Bruijn graphs (Q2497496) (← links)
- A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture (Q2519841) (← links)
- (Q2866624) (← links)
- Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles (Q2935291) (← links)
- (Q3099529) (← links)
- Two proofs of Bermond-Thomassen conjecture for regular tournaments (Q3439564) (← links)
- A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs (Q3563954) (← links)
- A New Proof of Wedderburn's Theorem (Q4469216) (← links)
- On the size of maximally non-hamiltonian digraphs (Q5225023) (← links)
- Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs (Q5962520) (← links)
- Edge clique covers in graphs with independence number two (Q6055943) (← links)
