Contracting a Chordal Graph to a Split Graph or a Tree

DOI10.1007/978-3-642-22993-0_32zbMath1343.68116OpenAlexW1661012590MaRDI QIDQ3088052

Daniël Paulusma, Marcin Kaminski, Petr A. Golovach

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83)

Related Items (4)

Detecting induced star-like minors in polynomial time ⋮ Edge contractions in subclasses of chordal graphs ⋮ Detecting fixed patterns in chordal graphs in polynomial time ⋮ Containment relations in split graphs

This page was built for publication: Contracting a Chordal Graph to a Split Graph or a Tree