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 “"Supereulerian Graph"”.
-
Eulerian subgraphs and Hamiltonicity of claw -free graphs
Let C(l, k) denote the class of 2-edge-connected graphs of order n such that a graph G ∈ C(l, k) if and only if for every edge cut S ⊆ E(G) with |S| ≤ 3, each component of G - S has order at least n-kl . We prove that If G ∈ C(6, 0), then G is supereulerian if and only if G cannot be contracted to …
-
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 …
-
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$, …
-
Circuits and Cycles in Graphs and Matroids
… focuses on characterizing cycles and circuits in graphs, line graphs and matroids. We obtain the following advances. 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 …