Triangle-Free Planar Graphs and Segment Intersection Graphs
Copyright policy )Triangle-Free Planar Graphs and Segment Intersection Graphs
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and oblique) and in such a way that no two segments cross, i.e., intersect in a common interior point.
Algorithm Analysis and Problem Complexity, Combinatorics, Graph theory (including graph drawing) in computer science, Discrete Mathematics in Computer Science, Computer graphics; computational geometry (digital and algorithmic aspects), triangle-free planar graphs, Computer Graphics, Computer Applications
Algorithm Analysis and Problem Complexity, Combinatorics, Graph theory (including graph drawing) in computer science, Discrete Mathematics in Computer Science, Computer graphics; computational geometry (digital and algorithmic aspects), triangle-free planar graphs, Computer Graphics, Computer Applications
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).21 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!