Results 41 to 50 of about 116,736 (298)
Long paths and cycles in random subgraphs of graphs with large minimum degree [PDF]
Random Struct. Algorithms, 2012 For a given finite graph G of minimum degree at least k, let Gp be a random subgraph of G obtained by taking each edge independently with probability p.
Michael Krivelevich +2 more
semanticscholar +1 more source
, 2012 У статті розглядаються Ейлерові шляхи й цикли.В статье рассматриваются Эйлеровые пути и циклы.The article deals with Euler paths and ...
Рудик, Олександр Борисович
core +1 more source
Turán problems and shadows I: Paths and cycles [PDF]
Journal of Combinatorial Theory, 2013 A k-path is a hypergraph P k = { e 1 , e 2 , ? , e k } such that | e i ? e j | = 1 if | j - i | = 1 and e i ? e j = ? otherwise. A k-cycle is a hypergraph C k = { e 1 , e 2 , ? , e k } obtained from a ( k - 1 ) -path { e 1 , e 2 , ? , e k - 1 } by adding
A. Kostochka +2 more
semanticscholar +1 more source
Paths and cycles in colored graphs [PDF]
, 2001 Let G be an (edge-)colored graph. A path (cycle) is called monochromatic if all the edges of it have the same color, and is called heterochromatic if all the edges of it have different colors. In this note, some sufficient conditions for the existence of
Broersma, Hajo; id_orcid +2 more
core +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
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
Complexity of coloring graphs without paths and cycles [PDF]
Discrete Applied Mathematics, 2013 Let P t and C l denote a path on t vertices and a cycle on l vertices, respectively. In this paper we study the k-COLORING problem for (P t ,C l)-free graphs.
P. Hell, Shenwei Huang
semanticscholar +1 more source
Coalition Graphs of Paths, Cycles, and Trees
Discussiones Mathematicae Graph Theory, 2021 A coalition in a graph G =(V, E) consists of two disjoint sets of vertices V1 and V2, neither of which is a dominating set of G but whose union V1 ∪ V2 is a dominating set of G.A coalition partition in a graph G of order n = |V | is a vertex partition π =
T. Haynes +4 more
semanticscholar +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