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 9 of 9 for “"Hamiltonian-connected"”.

  1. Group Colorability and Hamiltonian Properties of Graphs

    … by the conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Matthews and Sumner that every 4-connected claw-free graph is hamiltonian. Towards the hamiltonian line graph problem, we proved that every 3-edge-connected, essentially 4-edge-connected …

    wvu Repository record for Group Colorability and Hamiltonian Properties of Graphs (opens in a new tab)

  2. Cycles in graph theory and matroids

    A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is even. A graph G is Hamiltonian if it has a spanning circuit, and Hamiltonian-connected if for every pair of distinct vertices u, v ∈ V( G), G has a spanning (u, v)-path. A graph G is s-Hamiltonian if …

    wvu Repository record for Cycles in graph theory and matroids (opens in a new tab)

  3. Cycles, Disjoint Spanning Trees and Orientations of Graphs

    A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton path (a path including every vertex of G); and G is s-hamiltonian-connected if the deletion of any vertex subset with at most s vertices results in a hamiltonian-connected graph. We prove that the line graph …

    wvu Repository record for Cycles, Disjoint Spanning Trees and Orientations of Graphs (opens in a new tab)

  4. Supereulerian Properties in Graphs and Hamiltonian Properties in Line Graphs

    … number, which implies a characterization of hamiltonian claw-free graph with small independence number.;We also investigate strongly spanning trailable graphs and their applications to hamiltonian connected line graphs characterizations for small strongly spanning trailable graphs and …

    wvu Repository record for Supereulerian Properties in Graphs and Hamiltonian Properties in Line Graphs (opens in a new tab)

  5. Claw -free graphs and line graphs

    … by the conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Tutte that every 4-edge-connected graph has a no-where-zero 3-flow. Towards the hamiltonian line graph problem, we proved that every 3-connected N2-locally connected claw-free graph is …

    wvu Repository record for Claw -free graphs and line graphs (opens in a new tab)

  6. Topics in the Generation of Ideals of Posets

    … between vertices that differ by a swap, has a Hamiltonian path. The conjecture is true for series-parallel posets and interval orders. We prove the conjecture also holds for the fence posets, but that the conjecture is false for the 3-ideals of the crown poset with six elements. We also provide …

    carleton Repository record for Topics in the Generation of Ideals of Posets (opens in a new tab)

  7. Hamiltonian cycles in subset and subspace graphs.

    In this dissertation we study the Hamiltonicity and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general …

    unt Repository record for Hamiltonian cycles in subset and subspace graphs. (opens in a new tab)

  8. On Eulerian subgraphs and hamiltonian line graphs

    A graph {\color{black}$G$} is Hamilton-connected if for any pair of distinct vertices {\color{black}$u, v \in V(G)$}, {\color{black}$G$} has a spanning $(u,v)$-path; {\color{black}$G$} is 1-hamiltonian if for any vertex subset $S \subseteq {\color{black}V(G)}$ with $|S| \le 1$, $G - S$ has a …

    wvu Repository record for On Eulerian subgraphs and hamiltonian line graphs (opens in a new tab)

  9. Circuits and Cycles in Graphs and Matroids

    … 1. Results in graphs and line graphs. For a connected graph G not isomorphic to a path, a cycle or a K1,3, let pc(G) denote the smallest integer n such that the nth iterated line graph Ln(G) is panconnected. A path P is a divalent path of G if the internal vertices of P are of degree 2 in G. …

    wvu Repository record for Circuits and Cycles in Graphs and Matroids (opens in a new tab)