Some properties of edge intersection graphs of single bend paths on a grid

DOI10.1016/J.ENDM.2009.07.005MaRDI QIDQ2851434zbMATH OpenOpenAlexFDO

Authors Bernard Ries

Publication date 10 October 2013

Published in Electronic Notes 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

zbMATH Keywords

chordal graphedge intersection graphforbidden induced subgraphneighborhood

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Some properties of edge intersection graphs of single-bend paths on a grid
• Edge intersection graphs of systems of paths on a grid with a bounded number of bends
• Edge intersection graphs of single bend paths on a grid
• Edge-intersection graphs of grid paths: the bend-number
• Edge-Intersection Graphs of k-Bend Paths in Grids

Cites work

• Asteroidal Triple-Free Graphs
• Edge intersection graphs of single bend paths on a grid
• Ramsey-type theorems
• The Erdős-Hajnal conjecture for bull-free graphs

Cited in

(7)

• Proper circular arc graphs as intersection graphs of paths on a grid
• Edge-intersection graphs of grid paths: the bend-number
• 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
• Edge and vertex intersection of paths in a graph
• Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
• On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
• Some properties of edge intersection graphs of single-bend paths on a grid

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 Q2851434)