Characterising chordal contact B₀-VPG graphs

DOI10.1007/978-3-319-96151-4_8zbMATH Open1404.90129OpenAlexW2883924344MaRDI QIDQ1661864FDOQ1661864

Bernard Ries, M. P. Mazzoleni, Mariano Leonardo Rean, Flavia Bonomo

Publication date: 17 August 2018

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

zbMATH Keywords

chordal graphspolynomial-time algorithmforbidden induced subgraphscontact \(B_0\)-VPG graphsvertex intersection graphs

Mathematics Subject Classification ID

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

Cited In (4)

• Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
• On some special classes of contact \(B_0\)-VPG graphs
• \(B_0\)-VPG representation of AT-free outerplanar graphs
• Characterising circular-arc contact \(B_0\)-VPG graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661864)