Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
This paper develops new techniques for constructing separators for graphs embedded on surfaces of bounded genus. For any arbitrarily small positive " we show that any n-vertex graph G of genus g can be divided in O(n + g) time into components whose ...
L. Aleksandrov, H. Djidjev
core
The Crossing Number of The Hexagonal Graph H3,n
In [C. Thomassen, Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface, Trans. Amer. Math. Soc. 323 (1991) 605–635], Thomassen described completely all (except finitely many) regular tilings of the torus S1 and the ...
Wang Jing +2 more
doaj +1 more source
Financial fallout from the COVID-19 pandemic:Report from a high-volume academic neurosurgery. [PDF]
Loganadane G +13 more
europepmc +1 more source
The Thickness of Amalgamations and Cartesian Product of Graphs
The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been ...
Yang Yan, Chen Yichao
doaj +1 more source
A Continuum-Tensegrity Computational Model for Chondrocyte Biomechanics in AFM Indentation and Micropipette Aspiration. [PDF]
Arduino A +5 more
europepmc +1 more source
List Edge Colourings of Some 1-Factorable Multigraphs
The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and any set system fSe : e 2 E(G)g with each jSe j = k, we can choose elements se 2 Se such that se 6= sf whenever e and f are adjacent edges.
Luis Goddyn, M. N. Ellingham
core
A Sharp Threshold Phenomenon in String Graphs. [PDF]
Tomon I.
europepmc +1 more source
Properties of Minimal Charts and Their Applications X: Charts of Type (5, 2)
MSCYEAR = 2020MSC = Primary 57K45, 05C10; Secondary ...
Nagase, T., Shima, A.
core
Identification of candidate metabolite biomarkers for metabolic syndrome and its five components in population-based human cohorts. [PDF]
Shi M +22 more
europepmc +1 more source
The Page Number Problem for Partially Ordered Sets
Umieszczenie grafu w książce jest definiowane przez kolejność jego wierzchołków na grzbiecie książki i przyporządkowanie jego krawędzi stronom książki tak, aby na żadnej stronie krawędzie nie przecinały się. Umieszczenie zbioru częściowo uporządkowanego (
Kwiatkowska, Anna Beata
core

