Structural and Complexity Aspects of Line Systems of Graphs

@inproceedings{Jirsek2010StructuralAC,
  title={Structural and Complexity Aspects of Line Systems of Graphs},
  author={Jozef Jir{\'a}sek and Pavel Klav{\'i}k},
  booktitle={ISAAC},
  year={2010}
}
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweenness. 

A De Bruijn-Erdős Theorem in Graphs?

A set of n points in the Euclidean plane determines at least n distinct lines unless these n points are collinear. In 2006, Chen and Chvatal asked whether the same statement holds true in general

A De Bruijn-Erd\H{o}s theorem in graphs?

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in

Towards a de Bruijn–Erdős Theorem in the $$L_1$$-Metric

It is proved that the answer is affirmative for sets of sets of non-collinear points in the plane with the L_1 metric, provided that no two points share their x- or y-coordinate.

References

SHOWING 1-10 OF 23 REFERENCES

Graph reconstruction - a survey

The progress made on the Reconstruction Conjecture is reviewed, up to isomorphism, since it was first formulated in 1941 and a number of related questions are discussed.

A de Bruijn - Erdős theorem and metric spaces

It is shown that every noncollinear set of n points in the plane determines at least n distinct lines, and a possible generalization of this theorem in the framework of metric spaces is provided.

A de Bruijn - Erd\H{o}s theorem and metric spaces

De Bruijn and Erd\H{o}s proved that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chv\'atal suggested a possible generalization of this theorem in the

Metric graph theory and geometry: a survey

The article surveys structural characterizations of several graph classes defined by distance properties, which have in part a general algebraic flavor and can be interpreted as subdirect

A Linear Time Algorithm for Deciding Interval Graph Isomorphism

It is shown that for a somewhat larger class of graphs, namely the chordal graphs, isomorphism is as hard as for general graphs.

On approximating arbitrary metrices by tree metrics

A generation algorithm for the random generation of models of amorphous strutures, which can be modeled as graphs which see embedded in d-space, using the well known approach of simulating a rapidly-mixing Markov chain.

Graph isomorphism problem

The article is a creative compilation of certain papers devoted to the graph isomorphism problem, which have appeared in recent years. An approach to the isomorphism problem is proposed in the first

A Note on the Metric Properties of Trees