Characterization and a 2D Visualization of B_{0}-VPG Cocomparability Graphs
From MaRDI portal
Publication:5014117
DOI10.1007/978-3-030-68766-3_16OpenAlexW3133599531MaRDI QIDQ5014117FDOQ5014117
Authors: Sreejith K. Pallathumadam, Deepak Rajendraprasad
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.02173
Recommendations
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
- Splitting \(B_2\)-VPG graphs into outer-string and co-comparability graphs
- Bipartite Analogues of Comparability and Cocomparability Graphs
- scientific article; zbMATH DE number 4043898
- Characterising chordal contact \(B_0\)-VPG graphs
- On the intersection of tolerance and cocomparability graphs
- On the intersection of tolerance and cocomparability graphs
- On the power of graph searching for cocomparability graphs
- Characterising circular-arc contact \(B_0\)-VPG graphs
- Characterizations of treelike comparability graphs
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
- Domination on Cocomparability Graphs
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Intransitive indifference with unequal indifference intervals
- A Characterization of Comparability Graphs and of Interval Graphs
- Bipartite permutation graphs
- Intersection graphs of segments
- Vertex Intersection Graphs of Paths on a Grid
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- Posets and VPG graphs
- Area requirement and symmetry display of planar upward drawings
- The complexity of comparability graph recognition and coloring
- A bound on the dimension of interval orders
- Algorithms for plane representations of acyclic digraphs
- On grid intersection graphs
- Title not available (Why is that?)
- Planar graphs as VPG-graphs
- Recognizing string graphs in NP
- Tolerance graphs
- String graphs. II: Recognizing string graphs is NP-hard
- Bounds on the bend number of split and cocomparability graphs
- The Dimension of a Comparability Graph
- Grid intersection graphs and order dimension
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
- Characterizations of cographs as intersection graphs of paths on a grid
- Vertex intersection graphs of paths on a grid: characterization within block graphs
- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
Cited In (3)
This page was built for publication: Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014117)