Results 41 to 50 of about 27,017 (285)
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
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
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
Altered Dynamic Functional Network Connectivity in Post‐Stroke Aphasia
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Previous studies examining post‐stroke aphasia (PSA) patients via resting‐state functional magnetic resonance imaging (rs‐fMRI) have predominantly focused on static functional connectivity. In contrast, the current investigation aims to elucidate the alterations in dynamic functional network connectivity (dFNC) among PSA patients ...
Guihua Xu +6 more
wiley +1 more source
The Relationship Between Inflammation and Central Nervous System in Multiple Sclerosis
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Aim Multiple sclerosis is an autoimmune demyelination disease that is seen especially in the young population and has a progressive course, causing motor, sensory, and cognitive deficits. In the literature, the pathogenesis of MS disease and the interconnection between the immune and central nervous system in the disease have not been fully ...
Gamze Ansen +5 more
wiley +1 more source
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings
AKCE International Journal of Graphs and CombinatoricsA graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj +1 more source
Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
Discussiones Mathematicae Graph Theory, 2013 We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40+1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.
Borodin Oleg V., Ivanova Anna O.
doaj +1 more source
Advanced Engineering Materials, Volume 27, Issue 6, March 2025.ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
Discussiones Mathematicae Graph Theory, 2021 A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [k] = {1, 2, . . . , k}. Let p(u) denote the product of the color on a vertex u and colors on all the edges incident with u.
Dong Aijun, Li Tong
doaj +1 more source