Results 51 to 60 of about 192,888 (294)
Longer Cycles in Essentially 4-Connected Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 A planar 3-connected graph G is called essentially 4-connected if, for every 3-separator S, at least one of the two components of G − S is an isolated vertex.
Fabrici Igor +3 more
doaj +1 more source
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
, 2018 We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively.
C Bachmaier +13 more
core +1 more source
1-planarity of complete multipartite graphs
Discrete Applied Mathematics, 2012 AbstractA graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. We present the full characterization of 1-planar complete k-partite graphs.
Dávid Hudák, Július Czap
openaire +3 more sources
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július +2 more
doaj +1 more source
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph $G$ is equitably $k$-choosable if, for any given $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\lceil\frac{|V(G)|}{k}\rceil$ vertices.
Aijun Dong, Jianliang Wu
doaj +1 more source
Planar Graphs of Maximum Degree 6 and without Adjacent 8-Cycles Are 6-Edge-Colorable
Journal of Mathematics, 2021 In this paper, by applying the discharging method, we show that if G is a planar graph with a maximum degree of Δ=6 that does not contain any adjacent 8-cycles, then G is of class 1.
Wenwen Zhang
doaj +1 more source
Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases
Journal of Applied Computer Science & Mathematics, 2016 Cycle bases belong to a k-connected simple graph used both for listing and enumerating Hamiltonian cycles contained in a planar graph. Planar cycle bases have a weighted induced graph whose weight values limited to 1.
Retno MAHARESI
doaj +1 more source
Bar 1-Visibility Drawings of 1-Planar Graphs
, 2013 A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean +13 more
core +1 more source
On RAC drawings of 1-planar graphs
Theoretical Computer Science, 2017 Abstract A drawing of a graph is 1-planar if each edge is crossed at most once. A graph is 1-planar if it has a 1-planar drawing. A k-bend RAC (Right Angle Crossing) drawing of a graph is a polyline drawing where each edge has at most k bends and edges cross only at right angles. A graph is k-bend RAC if it has a k -bend RAC drawing.
Bekos, Michael A. +4 more
openaire +2 more sources
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