B0-VPG Representation of AT-free Outerplanar Graphs
DOI10.7155/JGAA.00648OpenAlexW4390454106MaRDI QIDQ6202310FDOQ6202310
Authors: Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad 
Publication date: 26 March 2024
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00648
Recommendations
graph drawingouterplanar graphsconnectivity augmentationAT-freeouterpathB\(_0\)-VPGlinear outerplanar graph
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Intersection graphs of segments
- Vertex Intersection Graphs of Paths on a Grid
- Triangle-Free Planar Graphs and Segment Intersection Graphs
- Every planar graph is the intersection graph of segments in the plane (extended abstract)
- Title not available (Why is that?)
- On the structure of graphs with path-width at most two
- Geometric simultaneous embeddings of a graph and a matching
- On grid intersection graphs
- Max point-tolerance graphs
- Planar graphs as VPG-graphs
- Recognizing string graphs in NP
- String graphs. II: Recognizing string graphs is NP-hard
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Augmenting Outerplanar Graphs
- Augmenting the connectivity of outerplanar graphs
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
- 2-connecting outerplanar graphs without blowing up the pathwidth
- Vertex intersection graphs of paths on a grid: characterization within block graphs
- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- Column planarity and partial simultaneous geometric embedding
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
- Not all planar graphs are in PURE-4-DIR
- Balanced circle packings for planar graphs
- \(B_0\)-VPG representation of AT-free outerplanar graphs
This page was built for publication: B0-VPG Representation of AT-free Outerplanar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202310)
