Near Matches
Ignore Exact
Everything
2
Eulerian graph
(
thing
)
by
artemis entreri
Sat Feb 10 2001 at 3:08:29
In
combinatorics
, a
eulerian graph
is one containing a
Euler cycle
. For (connected)
undirected graphs
, this is true if every
vertex
has
even degree
. For
directed graphs
, this is true if every
vertex
has equal
indegree
and
outdegree
.
Planar bipartite graphs
are
dual
to
planar Eulerian graphs
and
vice versa
.
--back to
combinatorics
--
simulated annealing
cryptographically secure random number sequence
Hamiltonian Path
Bode plot
Combinatorics
menstrual cycle
Euler diagram
outdegree
indegree
axis
graph
Log in
or
register
to write something here or to contact authors.