Edge-intersection graphs of grid paths: The bend-number
Authors:
- Daniel HeldtDHDaniel Heldt
- Kolja KnauerKKKolja Knauer
- Torsten UeckerdtTUTorsten Ueckerdt
- 1 April 2014
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 167, 144-162
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Some properties of edge intersection graphs of single-bend paths on a gridDiscrete Mathematics, 2012
- Some properties of edge intersection graphs of single bend paths on a gridElectronic Notes in Discrete Mathematics, 2009
- Edge intersection graphs of single bend paths on a gridNetworks, 2009
- Representing edge intersection graphs of paths on degree 4 treesDiscrete Mathematics, 2008
- Star arboricityCombinatorica, 1992
- Stretching a knock-knee layout for multilayer wiringIEEE Transactions on Computers, 1990
- Some results on linear arboricityJournal of Graph Theory, 1986
- A network flow solution to some nonlinear 0‐1 programming problems, with applications to graph theoryNetworks, 1982
- On double and multiple interval graphsJournal of Graph Theory, 1979
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976