Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Graph Square"”.

  1. Square Root Finding In Graphs

    … familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the …

    brock Repository record for Square Root Finding In Graphs (opens in a new tab)

  2. Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles

    … famous Four Color Theorem states that any planar graph can be properly colored using at most four colors. However, if we want to properly color the square of a planar graph (or alternatively, color the graph using distinct colors on vertices at distance up to two from each other), we will always …

    vcu Repository record for Coloring the Square of Planar Graphs Without 4-Cycles or 5-Cycles (opens in a new tab)

  3. A compactness theorem for Hamilton circles in infinite graphs

    The problem of defining cycles in infinite graphs has received much attention in the literature. Diestel and Kuhn have proposed viewing a graph as 1-complex, and defining a topology on the point set of the graph together with its ends. In this setting, a circle in the graph is a homeomorph of the …

    uvic Repository record for A compactness theorem for Hamilton circles in infinite graphs (opens in a new tab)