Results 51 to 60 of about 11,556 (115)
Structural properties of graph products
Journal of Graph Theory, Volume 109, Issue 2, Page 107-136, June 2025.Abstract Dujmovć, Joret, Micek, Morin, Ueckerdt, and Wood established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically studies various structural properties of cartesian, direct and strong products.
Robert Hickingbotham, David R. Wood
wiley +1 more source
Profinite rigidity for free‐by‐cyclic groups with centre
Journal of the London Mathematical Society, Volume 111, Issue 6, June 2025.Abstract A free‐by‐cyclic group FN⋊ϕZ$F_N\rtimes _\phi \mathbb {Z}$ has non‐trivial centre if and only if [ϕ]$[\phi]$ has finite order in Out(FN)${\rm {Out}}(F_N)$. We establish a profinite rigidity result for such groups: if Γ1$\Gamma _1$ is a free‐by‐cyclic group with non‐trivial centre and Γ2$\Gamma _2$ is a finitely generated free‐by‐cyclic group ...
Martin R. Bridson, Paweł Piwek
wiley +1 more source
On profinite rigidity amongst free‐by‐cyclic groups I: The generic case
Proceedings of the London Mathematical Society, Volume 130, Issue 6, June 2025.Abstract We prove that amongst the class of free‐by‐cyclic groups, Gromov hyperbolicity is an invariant of the profinite completion. We show that whenever G$G$ is a free‐by‐cyclic group with first Betti number equal to one, and H$H$ is a free‐by‐cyclic group which is profinitely isomorphic to G$G$, the ranks of the fibres and the characteristic ...
Sam Hughes, Monika Kudlinska
wiley +1 more source
Quasi-isometry classification of RAAGs that split over cyclic subgroups
, 2019 For a one-ended right-angled Artin group, we give an explicit description of its JSJ tree of cylinders over infinite cyclic subgroups in terms of its defining graph. This is then used to classify certain right-angled Artin groups up to quasi-isometry. In
Margolis, Alexander
core
Homomorphic Preimages of Geometric Cycles
, 2015 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core
GAHLS: an optimized graph analytics based high level synthesis framework. [PDF]
Sci Rep, 2023 Xiao Y, Nazarian S, Bogdan P.
europepmc +1 more source
Temporal networks in biology and medicine: a survey on models, algorithms, and tools. [PDF]
Netw Model Anal Health Inform Bioinform, 2023 Hosseinzadeh MM +3 more
europepmc +1 more source
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. [PDF]
Algorithmica, 2022 Nederlof J, Swennenhuis CMF.
europepmc +1 more source
Interval-valued bipolar fuzzy line graphs. [PDF]
BMC Res Notes, 2023 Tola KA, Repalle VNSR, Ashebo MA.
europepmc +1 more source
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021. [PDF]
Algorithmica, 2023 Flocchini P, Moura L.
europepmc +1 more source