Buscar
Mostrando ítems 1-10 de 1286
Removable paths and cycles with parity constraints
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2014)
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
(Wiley-Liss Inc., 2019)
© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distinct colours, given that ...
Does cycling infrastructure reduce stress biomarkers in commuting cyclists? A comparison of five European cities
(Elsevier B.V., 2020-10-01)
There is substantial evidence that the environment has an important impact on the use of bicycles. Changes in the built environment, such as cycling infrastructure provision, usually aim at improving the efficiency, ...
Removable cycles in non-bipartite graphs
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2009)
Powers of cycles, powers of paths, and distance graphs
(Elsevier Science, 2011-04)
In 1988, Golumbic and Hammer characterized the powers of cycles, relating them to circular arc graphs. We extend their results and propose several further structural characterizations for both powers of cycles and powers ...
Partitioning infinite hypergraphs into few monochromatic berge-paths
(Springer, 2020)
Extending a result of Rado to hypergraphs, we prove that for all s,k,t is an element of N$$s, k, t \in {\mathbb {N}}$$\end{document} with k >= t >= 2 the vertices of every r=s(k-t+1)-edge-coloured countably infinite complete ...
A weaker version of Lovasz' path removal conjecture
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2008)
Non-separating paths in 4-connected graphs
(Birkhauser Verlag AgBaselSuíça, 2005)
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
(Elsevier B.V., 2018)
Golumbic, Lipshteyn and Stern [12] proved that every graph can be represented as the edge
intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex
of the graph a nontrivial path on a ...