Algorithms for 3PC(⋅, ⋅)-free Berge graphs

DOI10.1016/J.ENDM.2005.06.013zbMath1182.05119OpenAlexW2006341025WikidataQ57949153 ScholiaQ57949153MaRDI QIDQ3439311

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

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/74355/2/3pc-square.pdf

zbMATH Keywords

algorithmgraphclaw-freestar decomposition3PC(.,.)clique of maximum weight

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• The strong perfect graph theorem
• Geometric algorithms and combinatorial optimization
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Recognizing Berge graphs

This page was built for publication: Algorithms for 3PC(⋅, ⋅)-free Berge graphs