Results 61 to 70 of about 974 (99)

Sharp Upper Bounds on the Clar Number of Fullerene Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
The Clar number of a fullerene graph with n vertices is bounded above by ⌊n/6⌋ − 2 and this bound has been improved to ⌊n/6⌋ − 3 when n is congruent to 2 modulo 6.
Gao Yang, Zhang Heping
doaj   +1 more source

On the Hamiltonian Number of a Plane Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2019
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj   +1 more source

Facial Rainbow Coloring of Plane Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj   +1 more source

Financial fallout from the COVID-19 pandemic:Report from a high-volume academic neurosurgery. [PDF]

open access: yesNeurochirurgie, 2022
Loganadane G   +13 more
europepmc   +1 more source

UNIFORM SPANNING FORESTS OF PLANAR GRAPHS

open access: yesForum of Mathematics, Sigma, 2019
We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm.
TOM HUTCHCROFT, ASAF NACHMIAS
doaj   +1 more source

A Continuum-Tensegrity Computational Model for Chondrocyte Biomechanics in AFM Indentation and Micropipette Aspiration. [PDF]

open access: yesAnn Biomed Eng, 2022
Arduino A   +5 more
europepmc   +1 more source

ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE

open access: yesForum of Mathematics, Sigma, 2016
For each integer $d\geqslant 3$ , we obtain a characterization of all graphs in which the ball of radius
ITAI BENJAMINI, DAVID ELLIS
doaj   +1 more source

Identification of candidate metabolite biomarkers for metabolic syndrome and its five components in population-based human cohorts. [PDF]

open access: yesCardiovasc Diabetol, 2023
Shi M   +22 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy