#### Filter Results:

#### Publication Year

2006

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Cornelia Dangelmayr, Stefan Felsner, William T. Trotter
- J. Graph Algorithms Appl.
- 2010

We investigate which chordal graphs have a representation as intersection graphs of pseu-dosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree are pseudosegment intersection graphs. We then study the limits of representability. We describe a family of… (More)

- Cornelia Dangelmayr, Stefan Felsner
- Graph Drawing
- 2006

We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. The main contribution is a construction which shows that all chordal graphs which have a representation as intersection graph of subpaths on a tree are representable. A family of intersection graphs of substars of a star is used to show that not all chordal… (More)

- M J Chávez, A Quintero, +20 authors Tristram Bogart
- 2006

New lower bounds for the number of (≤ k)-edges and the rectilinear crossing number of K n A characterization of the faces of the generalized cluster complex ∆ m (Φ) Abstract Given an integer matrix B, the Chvatal rank of B is the minimum number k such that for every right-hand side b, the integer hull of the rational polyhedron {x : Bx ≤ b} can be obtained… (More)

- ‹
- 1
- ›