Sciweavers

IPL
2006
72views more  IPL 2006»
13 years 11 months ago
Structure and linear time recognition of 3-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
Andreas Brandstädt, Van Bang Le
CCCG
2003
14 years 25 days ago
Equiprojective Polyhedra
A convex polyhedron P is equiprojective if, for some k, the orthogonal projection (or “shadow”) of P in every direction, except those directions parallel to faces of P, is a k...
Masud Hasan, Anna Lubiw
STACS
2010
Springer
14 years 6 months ago
Large-Girth Roots of Graphs
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
Anna Adamaszek, Michal Adamaszek