Even-hole-free graph
Encyclopedia
In the mathematical
area of graph theory
, a graph is even-hole-free if it contains no induced cycle with an even number of vertices
.
demonstrated that every even-hole-free graph contains a bisimplicial vertex, which settled a conjecture by Reed.
later improved this to .
While even-hole-free graphs can be recognized in polynomial time, it is NP-complete to determine whether a graph contains an even hole that includes a specific vertex.
Mathematics
Mathematics is the study of quantity, space, structure, and change. Mathematicians seek out patterns and formulate new conjectures. Mathematicians resolve the truth or falsity of conjectures by mathematical proofs, which are arguments sufficient to convince other mathematicians of their validity...
area of graph theory
Graph theory
In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects from a certain collection. A "graph" in this context refers to a collection of vertices or 'nodes' and a collection of edges that connect pairs of...
, a graph is even-hole-free if it contains no induced cycle with an even number of vertices
Vertex (graph theory)
In graph theory, a vertex or node is the fundamental unit out of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges , while a directed graph consists of a set of vertices and a set of arcs...
.
demonstrated that every even-hole-free graph contains a bisimplicial vertex, which settled a conjecture by Reed.
Recognition
gave the first polynomial time recognition algorithm for even-hole-free graphs, which runs in time.later improved this to .
While even-hole-free graphs can be recognized in polynomial time, it is NP-complete to determine whether a graph contains an even hole that includes a specific vertex.