Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time

DOI10.1007/978-3-319-07557-0_34zbMath1418.90270arXiv1310.8186OpenAlexW2962703021MaRDI QIDQ5419013

Oliver Schaudt, Henning Bruhn

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

claw-free graphsrecognition algorithminduced minors\(t\)-perfect graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Integer round-up property for the chromatic number of some \(h\)-perfect graphs

This page was built for publication: Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time