Convexity in graphs and hypergraphs
Convexity in graphs and hypergraphs
复制标题
DOI:
10.1137/0607049
复制
发表时间:
1986-07
期刊:
影响因子:
--
通讯作者:
M. Farber;R. Jamison
中科院分区:
文献类型:
--
作者:
M. Farber;R. Jamison
We study several notions of abstract convexity in graphs and hypergraphs. In each case, we obtain analogues of several classical results, including the Minkowski–Krein–Milman theorem, Caratheodory’s theorem and Tietze’s convexity theorem. In addition, our results yield new characterizations of the classes of chordal gaphs, strongly chordal graphs, Ptolemaic graphs and totally balanced hypergraphs.