Odd Hole Recognition in Graphs of Bounded Clique Size
From MaRDI portal
Publication:5470814
DOI10.1137/S089548010444540XzbMath1110.05054WikidataQ59904157 ScholiaQ59904157MaRDI QIDQ5470814
Xinming Liu, Cornuéjols, Gérard, Giacomo Zambelli, Kristina Vušković, Michele Conforti
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
One-three join: a graph operation and its consequences, Associated primes of monomial ideals and odd holes in graphs, Maximum weight independent sets in odd-hole-free graphs without dart or without bull, On the mixed set covering, packing and partitioning polytope, Induced packing of odd cycles in planar graphs, The strong perfect graph conjecture: 40 years of attempts, and its resolution, Unnamed Item, A faster algorithm to recognize even-hole-free graphs
