Results 231 to 240 of about 54,765 (253)
On paths and cycles through specified vertices
For a set X of vertices of a graph fulfilling a local connectedness condition results on the existence of paths and cycles containing X are ...
Jochen Harant
exaly +2 more sources
Properly colored paths and cycles
In 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 ...
Shinya Fujita, Colton R. Magnant
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Extending the p-cycle concept to path segment protection for span and node failure recovery
IEEE Journal on Selected Areas in Communications, 2003Gangxiang Shen, W D Grover
exaly
On Hamiltonian cycles and Hamiltonian paths
Information Processing Letters, 2005Mohammad Sohel Rahman
exaly
Controllability of multiagent systems based on path and cycle graphs
International Journal of Robust and Nonlinear Control, 2018Xianzhu Liu, Zhijian Ji
exaly
Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey
Graphs and Combinatorics, 2018Shuya Chiba, Tomoki Yamashita
exaly
An analysis of cyclists’ speed at combined pedestrian and cycle paths
Traffic Injury Prevention, 2019Jenny Eriksson +2 more
exaly

