On some special classes of contact B₀-VPG graphs

DOI10.1016/J.DAM.2019.10.008MaRDI QIDQ2064288zbMATH OpenOpenAlexFDO

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

Publication date 5 January 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\( P_4\)-tidy graph\( P_5\)-free graphchordal graphcontact \(B_0\)-VPG graphtree-cograph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Abstract: A graph $G$ is a $B_0$-VPG graph if one can associate a path on a rectangular grid with each vertex such that two vertices are adjacent if and only if the corresponding paths intersect at at least one grid-point. A graph $G$ is a contact $B_0$-VPG graph if it is a $B_0$-VPG graph admitting a representation with no two paths crossing and no two paths sharing an edge of the grid. In this paper, we present a minimal forbidden induced subgraph characterisation of contact $B_0$-VPG graphs within four special graph classes: chordal graphs, tree-cographs, $P_4$-tidy graphs and $P_5$-free graphs. Moreover, we present a polynomial-time algorithm for recognising chordal contact $B_0$-VPG graphs.

Recommendations

• Characterising chordal 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

Cites work

• A New Class of Brittle Graphs
• Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
• Characterising chordal contact \(B_0\)-VPG graphs
• Characterizations of cographs as intersection graphs of paths on a grid
• Classes and recognition of curve contact graphs
• Contact graphs of line segments are NP-complete
• Graph theory
• scientific article; zbMATH DE number 1375569 (Why is no real title available?)
• scientific article; zbMATH DE number 739017 (Why is no real title available?)
• scientific article; zbMATH DE number 1500690 (Why is no real title available?)
• Intersection graphs of curves in the plane
• Intersection graphs of L-shapes and segments in the plane
• On a unique tree representation for \(P_ 4\)-extendible graphs
• On contact graphs of paths on a grid
• On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
• Planar graphs as VPG-graphs
• Posets and VPG graphs
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
• Representations by contact and intersection of segments
• Strong tree-cographs are Birkhoff graphs
• Vertex Intersection Graphs of Paths on a Grid
• Vertex intersection graphs of paths on a grid: characterization within block graphs

Cited in

(8)

• Characterising chordal contact \(B_0\)-VPG graphs
• On contact graphs of paths on a grid
• Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
• Characterising circular-arc contact \(B_0\)-VPG 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
• \(B_0\)-VPG representation of AT-free outerplanar graphs
• Discriminating code and set cover with k-bend paths

This page was built for publication: On some special classes of contact \(B_0\)-VPG graphs

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