Some properties of edge intersection graphs of single-bend paths on a grid
DOI10.1016/J.DISC.2011.10.005zbMATH Open1243.05172OpenAlexW2175869348MaRDI QIDQ658070FDOQ658070
Authors: Juan-Miguel Gracia 
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/328807/files/1-s2.0-s0012365x11004547-main.pdf
Recommendations
- Some properties of edge intersection graphs of single bend paths on a grid
- Edge intersection graphs of single bend paths on a grid
- On edge-intersection graphs of \(k\)-bend paths in grids
- Edge-Intersection Graphs of k-Bend Paths in Grids
- Graphs of edge-intersecting and non-splitting one bend paths in a grid
- Edge-intersection graphs of grid paths: the bend-number
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends
- On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid
- scientific article; zbMATH DE number 7272507
- Edge-intersection graphs of boundary-generated paths in a grid
intersection graphschordal graphsneighborhood[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Hainal+property&go=Go Erd��s-Hainal property]paths on a gridsingle-bend paths
Cites Work
- Crossing patterns of semi-algebraic sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- On rigid circuit graphs
- The strong perfect graph theorem
- Representation of a finite graph by a set of intervals on the real line
- Edge-intersection graphs of grid paths: the bend-number
- Edge intersection graphs of single bend paths on a grid
- Asteroidal Triple-Free Graphs
- 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
- Recognizing bull-free perfect graphs
- Title not available (Why is that?)
- Ramsey-type theorems
- Intersection patterns of curves
Cited In (17)
- Edge-intersection graphs of boundary-generated paths in a grid
- Single bend paths on a grid have strong Helly number 4: errata atque emendationes ad ``Edge intersection graphs of single bend paths on a grid
- Proper circular arc graphs as intersection graphs of paths on a grid
- Edge intersection graphs of \(L\)-shaped paths in grids
- Some properties of edge intersection graphs of single bend paths on a grid
- Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
- On edge intersection graphs of paths with 2 bends
- Characterizations of cographs as intersection graphs of paths on a grid
- On the bend-number of planar and outerplanar graphs
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- Edge-intersection graphs of grid paths: the bend-number
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
- On split \(B_1\)-EPG graphs
- Edge intersection graphs of single bend paths on a grid
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
- Clique coloring \(B_1\)-EPG graphs
This page was built for publication: Some properties of edge intersection graphs of single-bend paths on a grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658070)
