Characterising chordal contact \(B_0\)-VPG graphs

DOI10.1007/978-3-319-96151-4_8zbMath1404.90129OpenAlexW2883924344MaRDI QIDQ1661864

Bernard Ries, María Pía Mazzoleni, Mariano Leonardo Rean, Flavia Bonomo-Braberman

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_8

zbMATH Keywords

polynomial-time algorithmchordal graphsforbidden induced subgraphscontact \(B_0\)-VPG graphsvertex intersection graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (2)

Characterising circular-arc contact \(B_0\)-VPG graphs ⋮ On some special classes of contact \(B_0\)-VPG graphs

This page was built for publication: Characterising chordal contact \(B_0\)-VPG graphs