Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph

Abstract

An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs. A graph is clique-separable precisely if every induced subgraph either has a clique cutset, or is a complete multipartite graph or a… (More)
DOI: 10.1016/j.dam.2008.08.020

Topics

1 Figure or Table

Cite this paper

@article{AddarioBerry2010FindingAM, title={Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph}, author={Louigi Addario-Berry and William Sean Kennedy and Andrew D. King and Zhentao Li and Bruce A. Reed}, journal={Discrete Applied Mathematics}, year={2010}, volume={158}, pages={765-770} }