Back to Search
Start Over
Bisimplicial vertices in even-hole-free graphs
- Source :
-
Journal of Combinatorial Theory - Series B . Nov2008, Vol. 98 Issue 6, p1119-1164. 46p. - Publication Year :
- 2008
-
Abstract
- Abstract: A hole in a graph is an induced subgraph which is a cycle of length at least four. A hole is called even if it has an even number of vertices. An even-hole-free graph is a graph with no even holes. A vertex of a graph is bisimplicial if the set of its neighbours is the union of two cliques. In this paper we prove that every even-hole-free graph has a bisimplicial vertex, which was originally conjectured by Reed. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00958956
- Volume :
- 98
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Journal of Combinatorial Theory - Series B
- Publication Type :
- Academic Journal
- Accession number :
- 34529838
- Full Text :
- https://doi.org/10.1016/j.jctb.2007.12.006