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 4 of 4 for “"Hamiltonian Line Graph"”.

  1. Claw -free graphs and line graphs

    … 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 hamiltonian, …

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

  2. Hamiltonian line graphs and claw -free graphs

    … 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-connected claw-free Z8-free graph is hamiltonian, where …

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

  3. Group Colorability and Hamiltonian Properties of Graphs

    … 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 graph G has …

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

  4. On Generalizations of Supereulerian Graphs

    A graph is supereulerian if it has a spanning closed trail. Pulleyblank in 1979 showed that determining whether a graph is supereulerian, even when restricted to planar graphs, is NP-complete. Let $\kappa'(G)$ and $\delta(G)$ be the edge-connectivity and the minimum degree of a graph $G$, …

    wvu Repository record for On Generalizations of Supereulerian Graphs (opens in a new tab)