Characterizations of cographs as intersection graphs of paths on a grid
From MaRDI portal
Publication:741533
DOI10.1016/J.DAM.2014.06.020zbMATH Open1300.05267OpenAlexW1968297533MaRDI QIDQ741533FDOQ741533
Authors: Elad Cohen, Martin Charles Golumbic, Bernard Ries 
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.06.020
Recommendations
Cites Work
- Title not available (Why is that?)
- Complement reducible graphs
- Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
- Edge-intersection graphs of grid paths: the bend-number
- Edge intersection graphs of single bend paths on a grid
- Vertex Intersection Graphs of Paths on a Grid
- Title not available (Why is that?)
- On edge-intersection graphs of \(k\)-bend paths in grids
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends
- A special planar satisfiability problem and a consequence of its NP- completeness
- A Linear Recognition Algorithm for Cographs
- Some properties of edge intersection graphs of single-bend paths on a grid
- A simple linear time algorithm for cograph recognition
- A Simple Linear Time LexBFS Cograph Recognition Algorithm
- Planar graphs as VPG-graphs
- Title not available (Why is that?)
- Induced subgraphs and well‐quasi‐ordering
- Title not available (Why is that?)
- Edge contractions in subclasses of chordal graphs
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
Cited In (13)
- Edge-intersection graphs of boundary-generated paths in a grid
- Proper circular arc graphs as intersection graphs of paths on a grid
- On contact graphs of paths on a grid
- Posets and VPG graphs
- Vertex intersection graphs of paths on a grid: characterization within block graphs
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
- The complexity of Helly-\(B_1\) EPG graph recognition
- On some special classes of contact \(B_0\)-VPG graphs
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
- Characterising circular-arc contact \(B_0\)-VPG graphs
- On grid intersection graphs
- Vertex Intersection Graphs of Paths on a Grid
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
This page was built for publication: Characterizations of cographs as intersection graphs of paths on a grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741533)
