Characterising chordal contact B₀-VPG graphs

DOI10.1007/978-3-319-96151-4_8MaRDI QIDQ1661864zbMATHzbMATHOpenAlexFDO

Authors M. P. Mazzoleni, Mariano Leonardo Rean, Bernard Ries, 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)

Recommendations

• On some special classes of contact \(B_0\)-VPG graphs
• Characterising circular-arc contact \(B_0\)-VPG graphs
• Vertex intersection graphs of paths on a grid: characterization within block graphs
• On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid

Cited in

(7)

• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
• On PVPG graphs: a subclass of vertex intersection graphs of paths on a grid
• Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
• \(B_0\)-VPG representation of AT-free outerplanar graphs
• Characterising circular-arc contact \(B_0\)-VPG graphs
• On some special classes of contact \(B_0\)-VPG graphs
• On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal 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)