Results 31 to 40 of about 395,936 (323)
Cycles and transitivity by monochromatic paths in arc-coloured digraphs
AKCE International Journal of Graphs and Combinatorics, 2015 A digraph D is an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a∈A(D), then colour(a) will denote the colour has been used on a.
Enrique Casas-Bautista +2 more
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 ...
Claverol Aguas, Mercè +4 more
openaire +7 more sources
Paths and cycles in extended and decomposable digraphs [PDF]
Discrete Mathematics, 1997 An extended locally semicomplete digraph, or extended LSD for short, is a digraph that can be obtained from locally semicomplete digraphs by substituting independent sets for vertices. The paper characterizes Hamiltonian extended LSDs as well as extended LSDs containing Hamiltonian paths, implying polynomial algorithms for finding a longest path and a ...
Bang-Jensen, J., Gutin, Gregory
openaire +9 more sources
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
Discussiones Mathematicae Graph Theory, 2021 Thomassen, [Edge-disjoint Hamiltonian paths and cycles in tournaments, J. Combin. Theory Ser. B 28 (1980) 142–163] proved that every strong tournament has a pair of arc-disjoint Hamiltonian paths with distinct initial vertices and distinct terminal ...
Meng Wei
doaj +1 more source
Sensors, 2021 Due to the appearance of smart textiles and wearable electronics, the need for electro-conductive textiles and electro-conductive paths on textiles has become clear.
Agnieszka Tabaczyńska +2 more
doaj +1 more source
Exact Values for Some Size Ramsey Numbers of Paths and Cycles
Frontiers in Physics, 2020 For the graphs G1, G2, and G, if every 2-coloring (red and blue) of the edges of G results in either a copy of blueG1 or a copy of redG2, we write G → (G1, G2).
Xiangmei Li +3 more
doaj +1 more source
On cycles and paths in digraphs
Discrete Mathematics, 1980 AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and number of arcs to insure the existence of cycles and paths in directed graphs. We show that these results are the best possible. The proofs of the theorems can be found in [4].
openaire +2 more sources
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 H-Supermagic Labelings of m-Shadow of Paths and Cycles
International Journal of Mathematics and Mathematical Sciences, 2019 A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f:V∪E→{1,2,3,…,V+E} is an (a,d)-H-antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the sum of ...
Ika Hesti Agustin +5 more
doaj +1 more source
Roman domination number on cardinal product of paths and cycles
Croatian Operational Research Review, 2015 In this paper, the authors have determined certain upper and lower bounds for Roman domination numbers on cardinal products for any two graphs and some exact values for the cardinal product of paths and cycles.
Antoaneta Klobučar, Ivona Puljić
doaj +1 more source