Results 31 to 40 of about 413 (64)
Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
, 2014 In 1992, Manoussakis conjectured that a strongly 2-connected digraph $D$ on $n$ vertices is hamiltonian if for every two distinct pairs of independent vertices $x,y$ and $w,z$ we have $d(x)+d(y)+d(w)+d(z)\geq 4n-3$.
Ning, Bo
core +1 more source
Hamiltonian Normal Cayley Graphs
Discussiones Mathematicae Graph Theory, 2019 A variant of the Lovász Conjecture on hamiltonian paths states that every finite connected Cayley graph contains a hamiltonian cycle. Given a finite group G and a connection set S, the Cayley graph Cay(G, S) will be called normal if for every g ∈ G we ...
Montellano-Ballesteros Juan José +1 more
doaj +1 more source
2-Spanning Cyclability Problems of Some Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2020 A graph G is called r-spanning cyclable if for every r distinct vertices v1, v2, . . . , vr of G, there exists r cycles C1, C2, . . . , Cr in G such that vi is on Ci for every i, and every vertex of G is on exactly one cycle Ci.
Yang Meng-Chien +3 more
doaj +1 more source
Alternating Hamiltonian cycles in $2$-edge-colored multigraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an $\mathcal{NP ...
Alejandro Contreras-Balbuena +2 more
doaj +1 more source
Edge-Connectivity and Edges of Even Factors of Graphs
Discussiones Mathematicae Graph Theory, 2019 An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. Jackson and Yoshimoto showed that if G is a 3-edge-connected graph with |G| ≥ 5 and v is a vertex with degree 3, then G has an even factor F containing two ...
Haghparast Nastaran, Kiani Dariush
doaj +1 more source
Matchings of quadratic size extend to long cycles in hypercubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Ruskey and Savage in 1993 asked whether every matching in a hypercube can be extended to a Hamiltonian cycle. A positive answer is known for perfect matchings, but the general case has been resolved only for matchings of linear size.
Tomáš Dvořák
doaj +1 more source
On minimum degree conditions for supereulerian graphs [PDF]
, 1999 A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected graph of order $n$ such that each minimal edge cut $E \subseteq E (G)$ with $|E| \le 3$ satisfies the property that each component of $G-E$ has order at ...
Broersma, H.J., Xiong, L.
core +2 more sources
Note on Ideal Based Zero-Divisor Graph of a Commutative Ring
Discussiones Mathematicae - General Algebra and Applications, 2017 In this paper, we consider the ideal based zero divisor graph ΓI(R) of a commutative ring R. We discuss some graph theoretical properties of ΓI(R) in relation with zero divisor graph.
Mallika A., Kala R., Selvakumar K.
doaj +1 more source
Connected even factors in k-tree
Open Mathematics, 2020 A connected even [2,2s]{[}2,2s]-factor of a graph G is a connected factor with all vertices of degree i(i=2,4,…,2s)i(i=2,4,\ldots ,2s), where s≥1s\ge 1 is an integer. In this paper, we show that a k+1s+2\tfrac{k+1}{s+2}-tough k-tree has a connected even [
Li Yinkui +4 more
doaj +1 more source
Vertices with the Second Neighborhood Property in Eulerian Digraphs
, 2014 The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property.
Dong-Lan Luo (608306) +8 more
core +3 more sources