Results 21 to 30 of about 1,206,642 (268)
On the saturation number of Hamiltonian path
上海师范大学学报. 自然科学版, 2022 Let $F$ be a graph and graph $G$ is said to be $F$-saturated if $G$ is $F$-free.However, for any edge $e\in E(\overline{G})$, $G+e$ contains $F$.Let sat($n,F$)= min{|$E(G)$|:|$V(G)$|=$n$ and $G$ is $F$-saturated}. We will show that there exists sat($n,P_{
DING Tianping, JIN Yalei, ZHANG Qian
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2015 For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic.
Bi Zhenming, Zhang Ping
doaj +1 more source
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
Unfolding Orthotubes with a Dual Hamiltonian Path
CoRR, 2022 An orthotube consists of orthogonal boxes (e.g., unit cubes) glued face-to-face to form a path. In 1998, Biedl et al. showed that every orthotube has a grid unfolding: a cutting along edges of the boxes so that the surface unfolds into a connected planar shape without overlap.
Erik D. Demaine, Kritkorn Karntikoon
openaire +4 more sources
Grafos hamiltonianos en el diseño de viajes
Modelling in Science Education and Learning, 2013 The existence and, if applicable, the location of paths with given properties is a topic in graph theory. One of these problems is to find routes through all points, only once, starting and ending at the same node.
Cristina Jordán Lluch +1 more
doaj +1 more source
Noncrossing Hamiltonian Paths in Geometric Graphs [PDF]
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jakub Cerný +3 more
openaire +3 more sources
Problems on Shortest k-Node Cycles and Paths
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph.
Petro Stetsyuk +2 more
doaj +1 more source
Hamiltonian paths in infinite graphs [PDF]
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Energy Conditions for Hamiltonian and Traceable Graphs
Universal Journal of Mathematics and Applications, 2019 A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the
Rao Li
doaj +1 more source
On Hamiltonian alternating cycles and paths
Computational Geometry, 2018 We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same ...
Mercè Claverol +4 more
openaire +8 more sources