Results 51 to 60 of about 147,831 (333)
The k-subconnectedness of planar graphs
AIMS Mathematics, 2021 A graph G with at least 2k vertices is called k-subconnected if, for any 2k vertices x1,x2,⋯,x2k in G, there are k independent paths joining the 2k vertices in pairs in G.
Zongrong Qin, Dingjun Lou
doaj +1 more source
Contact Representations of Graphs in 3D
, 2015 We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected planar graph, there
A Bezdek +17 more
core +1 more source
The planar Cayley graphs are effectively enumerable I: consistently planar graphs [PDF]
, 2019 We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere.
Georgakopoulos, Agelos, Hamann, Matthias
core +2 more sources
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [PDF]
, 2008 We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al.
Datta, Samir +2 more
core +7 more sources
Planar lattices and planar graphs
Journal of Combinatorial Theory, Series B, 1976 AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
openaire +3 more sources
On the planarity of Hanoi graphs
Expositiones Mathematicae, 2002 This note investigates Hanoi graphs \(H^n_m\) which are defined as the state graphs of the well-known game of Hanoi with \(n\) disks and \(m+3\) pegs. It is shown that all those graphs are Hamiltonian and precisely \(H^0_m\), \(H^n_0\), \(H^1_1\) and \(H^2_1\) are planar.
Daniele Parisse, Andreas M. Hinz
openaire +2 more sources
Discrete Applied Mathematics, 1998 The 1-skeleton of a spherical polyhedron might also be viewed as the 1-skeleton of other panelled structures (perhaps having holes, for example). The authors characterize those collections of cycles of a planar graph that bound the panels of hinged-panel structures, and distinguish those arising from spherical polyhedra.
Don Row, James Oxley
openaire +3 more sources
On the planarity of jump graphs
Discrete Mathematics, 2000 Let \(G\) be a graph of size \(m\geq 1\) and let \(F\) and \(H\) be edge-induced subgraphs of \(G\) of size \(k\) with \(1\leq k\leq m\). In the literature is then defined the \(k\)-jump distance from \(F\) to \(H\). For a graph \(G\) of size \(m\geq 1\) and an integer \(k\) with \(1\leq k\leq m\), the \(k\)-jump graph \(J_k(G)\) is defined as a graph ...
Donald W. VanderJagt +2 more
openaire +2 more sources
The Associations Between Chronic Active Lesions and White Matter Disease: A 7 Tesla Imaging Study
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background The relationship between paramagnetic rim lesions (PRLs) and surrounding normally appearing white matter (NAWM) disease, potentially contributory to the associations seen between PRLs and clinical impairment, is underexplored. Objectives To assess whether PRLs correlate with a greater degree of NAWM injury in early MS.
Ellie McCluey +17 more
wiley +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objectives Repetitive transcranial magnetic stimulation (rTMS) is a non‐invasive brain stimulation strategy with a demonstrated potential to reinforce the residual pathways after a spinal cord injury (SCI). A preclinically tested high‐frequency (15 Hz) rTMS (15 Hz rTMS) protocol was shown to induce corticospinal tract axon regeneration growth ...
Nabila Brihmat +8 more
wiley +1 more source