Results 61 to 70 of about 395,936 (323)
Properly colored paths and cycles
AbstractIn an edge-colored graph, let dc(v) be the number of colors on the edges incident to v and let δc(G) be the minimum dc(v) over all vertices v∈G. In this work, we consider sharp conditions on δc(G) which imply the existence of properly edge-colored paths and cycles, meaning no two consecutive edges have the same color.
Fujita, Shinya, Magnant, Colton
openaire +3 more sources
Kernel Bounds for Path and Cycle Problems [PDF]
Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization lower bounds.
Hans L. Bodlaender +2 more
openaire +8 more sources
Financial Distress and its Determinants in Rheumatoid Arthritis
Objective To quantify the degree of financial distress and identify its determinants in adults with rheumatoid arthritis (RA) given the frequent chronic use of expensive disease modifying therapies. Methods We identified adults enrolled in the FORWARD databank with either RA or non‐inflammatory musculoskeletal disease (NIMSKD) completing the Functional
Amber Brown Keebler +5 more
wiley +1 more source
In vitro cancer models are advantageous for studying important processes such as tumorigenesis, cancer growth, invasion, and metastasis. The complexity and biological relevance increase depending on the model structure, organization, and composition of materials and cells.
Kyndra S. Higgins +2 more
wiley +1 more source
Contracting Bipartite Graphs to Paths and Cycles [PDF]
9 pages, 2 ...
Konrad K. Dabrowski, Daniël Paulusma
openaire +6 more sources
Infrared (IR) light evokes distinct calcium and water transport responses in astrocytes, depending on stimulation duration and protocol. This study uses widefield imaging and pharmacology to reveal differential engagement of astroglial signaling pathways.
Wilson R. Adams +7 more
wiley +1 more source
Conjectures About Wheels Without One Edge with Paths and Cycles
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by ...
Michal Staš, Mária Timková
doaj +1 more source
Transversals of Longest Paths and Cycles [PDF]
Let G be a graph of order n. Let 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 lct(G) analogously for cycles instead of paths. We prove that lpt(G) \leq ceiling(n/4-n^{2/3}/90), if G is connected, lct(G) \leq ceiling(n/3-n^{2/3}/36), if G is 2-connected, and \lpt(G) \leq 3, if G ...
Dieter Rautenbach +1 more
openaire +3 more sources
Minimum degrees for powers of paths and cycles
We study minimum degree conditions under which a graph $G$ contains $k^{th}$ power of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of G is large.
Hng, Eng Keat
core
The Ramsey number of loose paths in 3-uniform hypergraphs [PDF]
Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of 3-uniform loose paths when one of the paths is significantly larger than the other: for every $n ...
Maherani, Leila +3 more
core

