25 search results - page 1 / 5» Subdivisions of graphs: A generalization of paths and cycles |

DM

2008

13 years 4 months ago
2008

One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...

CPC

2004

13 years 4 months ago
2004

Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...

DAM

2011

12 years 11 months ago
2011

In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...

ENDM

2007

13 years 4 months ago
2007

An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...

CCCG

2008

13 years 5 months ago
2008

Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...