Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs

DOI10.1137/050628520zbMath1165.68056arXiv1309.0694OpenAlexW3121286732WikidataQ59903865 ScholiaQ59903865MaRDI QIDQ3614194

Frédéric Maffray, Kristina Vušković, Nicolas Trotignon

Publication date: 16 March 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.0694

zbMATH Keywords

perfect graphscombinatorial algorithmsrecognition algorithmstar decompositionmaximum weight clique algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Related Items (5)

The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs ⋮ On the forbidden induced subgraph sandwich problem ⋮ The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs ⋮ Detecting induced subgraphs ⋮ Vertex elimination orderings for hereditary graph classes

This page was built for publication: Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs