A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) cycle is called a unicyclic graph.
A cyclic graph is bipartiteiff all its cycles are of even length (Skiena 1990, p. 213).
Unfortunately, the term "cyclic graph" is sometimes also used in several other distinct and mutually incompatible ways in mathematics, especially outside graph theory. It is for example sometimes used to mean a Hamiltonian graph, a graph isomorphic to a cycle graph, or a cycle graph itself (Trudeau 1994). Some care is therefore needed when consulting the literature.
, or a cycle graph itself (Trudeau 1994). Some care is therefore needed when consulting the literature. 