Let k be a non-negative integer. A graph is said to be a k-bend graph if it is a planar graph in which each edge is represented by at most k+1 horizontal and vertical segments. A graph is called k-embeddable if it has...Let k be a non-negative integer. A graph is said to be a k-bend graph if it is a planar graph in which each edge is represented by at most k+1 horizontal and vertical segments. A graph is called k-embeddable if it has a planar embedding which is a k-bend graph. On the k-embeddability of a graph, [1] provided the characterizations of k-embeddability, k≤3,展开更多
文摘Let k be a non-negative integer. A graph is said to be a k-bend graph if it is a planar graph in which each edge is represented by at most k+1 horizontal and vertical segments. A graph is called k-embeddable if it has a planar embedding which is a k-bend graph. On the k-embeddability of a graph, [1] provided the characterizations of k-embeddability, k≤3,
