The "'MaxCliqueDyn algorithm "'is an algorithm for finding a maximum clique in an undirected graph.
32.
In an undirected graph, reachability between all pairs of vertices can be determined by identifying the connected components of the graph.
33.
The unknotting problem has the same computational complexity as testing whether an embedding of an undirected graph in Euclidean space is linkless.
34.
An undirected graph is perfect if, in every induced subgraph, the chromatic number equals the size of the largest clique.
35.
In the planar undirected graph with 5 vertices and 5 edges, in the form of a triangle with two disjoint pendant edges.
36.
Although not part of the definition of MSO 2, orientations of undirected graphs can be represented by a technique involving Tr�maux trees.
37.
Ore's theorem may be obtained from Woodall by replacing every edge in a given undirected graph by a pair of directed edges.
38.
Consider a given graph and the family of undirected graphs that can be constructed by adding one or more edges from a given set.
39.
Is there a way to tell if an undirected graph is acyclic ( or cyclic ) based on the properties of its adjacency matrix?
40.
The electrical flow algorithm of Christiano, Kelner, Madry, and Spielman finds an approximately optimal maximum flow but only works in undirected graphs.
