- In
graph theory, a
Meyniel graph is a
graph in
which every odd
cycle of
length five or more has at
least two
chords (edges
connecting non-consecutive...
- Laurène
Meyniel-Schicklin is a
bioinformatics engineer who
specializes in
genomic data science. In 2014 she co-founded Enyo
Pharma where she conducts...
-
Hamiltonian if
every vertex has a full
degree greater than or
equal to n.
Meyniel (1973) — A
strongly connected simple directed graph with n
vertices is...
-
undirected graph by a pair of
directed edges. A
closely related theorem by
Meyniel (1973)
states that an n-vertex
strongly connected digraph with the property...
-
maximal cliques. In the
Meyniel graphs or very
strongly perfect graphs,
every vertex belongs to such an
independent set. The
Meyniel graphs can also be characterized...
-
every three vertices have a
unique median.
Meyniel 1. Henri
Meyniel,
French graph theorist. 2. A
Meyniel graph is a
graph in
which every odd
cycle of...
- doi:10.1016/j.bbrc.2013.01.132. PMID 23415865.
Navratil V, de Ch****ey B,
Meyniel L,
Pradezynski F, André P, Rabourdin-Combe C,
Lotteau V (July 2010). "System-level...
-
pebbling conjecture on the
pebbling number of
Cartesian products of
graphs Meyniel's conjecture that cop
number is O ( n ) {\displaystyle O({\sqrt {n}})} The...
- -vertex graph? (more
unsolved problems in mathematics)
Henri Meyniel (also
known for
Meyniel graphs)
conjectured in 1985 that
every connected n {\displaystyle...
- graphs, cop-win graphs, odd-hole-free graphs, even-hole-free graphs, and
Meyniel graphs.
Chordal graphs are
precisely the
graphs that are both odd-hole-free...
