Results 21 to 30 of about 3,678 (251)
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
FBSDEs with time delayed generators:L-P-solutions, differentiability, representation formulas and path regularity [PDF]
, 2011 We extend the work of Delong and Imkeller (2010) [6,7] concerning backward stochastic differential equations with time delayed generators (delay BSDEs). We give moment and a priori estimates in general L-p-spaces and provide sufficient conditions for the
Gonçalo dos Reis +5 more
core +1 more source
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
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
On mutually independent hamiltonian paths
Applied Mathematics Letters, 2006 Two Hamiltonian paths \(P_1=\langle v_1,v_2,\dots,v_n\rangle\) and \(P_2=\langle u_1,u_2,\dots,u_n\rangle\) of an \(n\)-vertex graph \(G\) are independent if \(u_1=v_1\), \(u_n=v_n\), and \(u_i\neq v_i\) for ...
Yuan-Hsiang Teng +3 more
openaire +2 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
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 +2 more sources
Triangle-different Hamiltonian paths
Journal of Combinatorial Theory, Series B, 2018 Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different Hamiltonian paths is equal to the number of balanced bipartitions of the ground set, answering a question of ...
István Kovács, Daniel Soltész
openaire +4 more sources
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 +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 +3 more sources