String graphs of k-bend paths on a grid
Authors:
- Andrei AsinowskiAAAndrei Asinowski
- Elad CohenECElad Cohen
- Martin Charles GolumbicMGMartin Charles Golumbic
- Vincent LimouzyVLVincent Limouzy
- Marina LipshteynMLMarina Lipshteyn
- Michal SternMSMichal Stern
- 1 August 2011
- journal article
- research article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 37, 141-146
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- String graphs of k-bend paths on a gridElectronic Notes in Discrete Mathematics, 2011
- Intersection Graphs of SegmentsJournal of Combinatorial Theory, Series B, 1994
- A special planar satisfiability problem and a consequence of its NP-completenessDiscrete Applied Mathematics, 1994
- Grid intersection graphs and boxicityDiscrete Mathematics, 1993
- String graphs. I. The number of critical nonstring graphs is infiniteJournal of Combinatorial Theory, Series B, 1991
- On grid intersection graphsDiscrete Mathematics, 1991
- Stretching a knock-knee layout for multilayer wiringIEEE Transactions on Computers, 1990
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- Intersection graphs of curves in the planeJournal of Combinatorial Theory, Series B, 1976