Results 31 to 40 of about 116,736 (298)
Turing kernelization for finding long paths and cycles in restricted graph classes [PDF]
Journal of computer and system sciences (Print), 2014 The k-Path problem asks whether a given undirected graph has a (simple) path of length k. We prove that k-Path has polynomial-size Turing kernels when restricted to planar graphs, graphs of bounded degree, claw-free graphs, or to K 3 , t -minor-free ...
B. Jansen
semanticscholar +1 more source
Partitioning 3-colored complete graphs into three monochromatic cycles [PDF]
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core +1 more source
On-line Ramsey Numbers of Paths and Cycles [PDF]
Electronic Journal of Combinatorics, 2014 Consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some
Joanna Cyman +3 more
semanticscholar +1 more source
Decomposition of hypercube graphs into paths and cycles of length four
AKCE International Journal of Graphs and Combinatorics, 2022 By a [Formula: see text]-decomposition of a graph G, we mean a partition of the edge set of G into p paths of length 4 and q cycles of length 4. In this paper, we give conditions for a [Formula: see text]-decomposition of the n-dimensional hypercube ...
D. Saranya, S. Jeevadoss
doaj +1 more source
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
Domination game on paths and cycles
Ars Math. Contemp., 2017 Domination game is a game on a simple graph played by two players, Dominator and Staller, who are alternating in taking turns. In each turn a player chooses a vertex in such a way that at least one new vertex gets dominated by this move.
Gasper Kosmrlj
semanticscholar +1 more source
On the radio number for corona of paths and cycles
AKCE International Journal of Graphs and Combinatorics, 2020 Radio -coloring of graphs is one of the variations of frequency assignment problem. For a simple connected graph and a positive integer , a radio -coloring is an assignment of positive integers (colors) to the vertices of such that for every pair of ...
Niranjan P.K., Srinivasa Rao Kola
doaj +1 more source
Long cycles in graphs without hamiltonian paths [PDF]
, 2008 For a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, respectively. Bondy and Locke [J.A. Bondy, S.C. Locke, Relative length of paths and cycles in 3-connected graphs, Discrete Math. 33 (1981) 111–122] consider the gap
Yamashita, Tomoki +5 more
core +1 more source
Transversals of Longest Paths and Cycles [PDF]
SIAM Journal on Discrete Mathematics, 2013 Let $G$ be a graph of order $n$. Let $\mathrm{lpt}(G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $X$ intersects every longest path of $G$, and define $\mathrm{lct}(G)$ analogously for cycles instead of paths.
D. Rautenbach, Jean-Sébastien Sereni
semanticscholar +1 more source
On Edge Irregularity Strength of Mycielskian of Paths and Cycles
Journal of Mines, Metals and FuelsFor a graph G having no loops and parallel edges, a labeling on the vertex set of G,Ψ:V(G)→{1,2,…,α} is refers to α-labeling. Let ab∈G be an edge. Then the weight the edge ab is zΨ (ab)=Ψ(a)+Ψ(b).
Umme Salma +3 more
semanticscholar +1 more source