Even-hole-free graph
id:
even-hole-free-graph-261-9847883
title:
Even-hole-free graph
text:
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. More precisely, the definition may allow the graph to have induced cycles of length four, or may also disallow them: the latter is referred to as even-cycle-free graphs. Addario-Berry et al. (2008) demonstrated that every even-hole-free graph contains a bisimplicial vertex, which settled a conjecture by Reed. The proof was later shown to be flawed by Chudnovsky & S
brand slug:
wiki
category slug:
encyclopedia
description:
Graph containing no induced cycles with an even number of nodes
original url:
https://en.wikipedia.org/wiki/Even-hole-free_graph
date created:
date modified:
2024-01-15T10:10:22Z
main entity:
{"identifier":"Q5416492","url":"https://www.wikidata.org/entity/Q5416492"}
image:
fields total:
13
integrity:
14