B0-VPG Representation of AT-free Outerplanar Graphs

DOI10.7155/JGAA.00648MaRDI QIDQ6202310zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00648

zbMATH Keywords

graph drawingouterplanar graphsconnectivity augmentationAT-freeouterpathB\(_0\)-VPGlinear outerplanar graph

Mathematics Subject Classification ID

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)

Recommendations

• Planar graphs as VPG-graphs
• Planar graphs as VPG-graphs
• Vertex Intersection Graphs of Paths on a Grid
• String graphs of \(k\)-bend paths on a grid
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid

Cites work

• scientific article; zbMATH DE number 3547322 (Why is no real title available?)
• scientific article; zbMATH DE number 739017 (Why is no real title available?)
• scientific article; zbMATH DE number 6850320 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• 2-connecting outerplanar graphs without blowing up the pathwidth
• A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
• Augmenting Outerplanar Graphs
• Augmenting the connectivity of outerplanar graphs
• Balanced circle packings for planar graphs
• Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
• Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
• Column planarity and partial simultaneous geometric embedding
• Every planar graph is the intersection graph of segments in the plane (extended abstract)
• Geometric simultaneous embeddings of a graph and a matching
• Intersection graphs of segments
• Max point-tolerance graphs
• Not all planar graphs are in PURE-4-DIR
• On grid intersection graphs
• On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
• On the structure of graphs with path-width at most two
• Planar graphs as VPG-graphs
• Recognizing string graphs in NP
• String graphs. II: Recognizing string graphs is NP-hard
• Triangle-Free Planar Graphs and Segment Intersection Graphs
• Vertex Intersection Graphs of Paths on a Grid
• Vertex intersection graphs of paths on a grid: characterization within block 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)