Results 61 to 70 of about 192,888 (294)

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

Recognizing and Drawing IC-planar Graphs

, 2015
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs.
C Auer, C Auer, C Binucci, C Thomassen, D Král, E Ackerman, E Giacomo Di, E Giacomo Di, E Giacomo Di, EN Argyriou, FJ Brandenburg, H Fraysseix de, J Fox, J Pach, M Chrobak, MA Bekos, MJ Alam, MR Garey, O Cheong, OV Borodin, P Eades, S Hong, S-H Hong, VP Korzhik, W Didimo, W Didimo, X Zhang, X Zhang   +27 more
core   +1 more source

Data‐driven forecasting of ship motions in waves using machine learning and dynamic mode decomposition

International Journal of Adaptive Control and Signal Processing, EarlyView.
Summary Data‐driven forecasting of ship motions in waves is investigated through feedforward and recurrent neural networks as well as dynamic mode decomposition. The goal is to predict future ship motion variables based on past data collected on the field, using equation‐free approaches.
Matteo Diez, Mauro Gaggero, Andrea Serani   +2 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

Structure of Projective Planar Subgraphs of the Graph Obstructions for Fixed Surface

Кібернетика та комп'ютерні технології, 2022
Consider the problem of studying the metric properties of a subgraph G \ v, where v is an arbitrary vertex of obstruction graphs G of a nonorientable genus, which will determine the sets of points of attachment of one subgraph to another and allow ...
Volodymyr Petrenjuk, Dmytro Petreniuk, Oleh Oryshaka   +2 more
doaj   +1 more source

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs [PDF]

, 2013
A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp.
Evans, William, Kaufmann, Michael, Lenhart, William, Liotta, Giuseppe, Mchedlidze, Tamara, Wismath, Stephen   +5 more
core  

Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

, 2009
A greedy embedding of a graph $G = (V,E)$ into a metric space $(X,d)$ is a function $x : V(G) \to X$ such that in the embedding for every pair of non-adjacent vertices $x(s), x(t)$ there exists another vertex $x(u)$ adjacent to $x(s)$ which is closer to $
A. Kelmans, A. Kelmans, A. Rao, A.E.F. Clementi, C. Monma, C. Thomassen, C.H. Papadimitriou, F. Kuhn, J.A. Bondy, P. Angelini, P. Bose, P. Bose, T. Leighton, W.T. Tutte   +13 more
core   +2 more sources

Microphysiological Glomerular Filtration Barriers: Current Insights, Innovations, and Future Applications

Advanced Biology, EarlyView.
The glomerular filtration barrier (GFB) is the first step of blood filtration by the kidneys. The concerning increase of kidney diseases makes the development of new models essential. In this context, microphysiological glomerular filtration barriers focus on closely reproducing the physiological architecture of the in vivo GFB: podocytes, glomerular ...
Manon Miran, Kieu Ngo, David Buob, Hanna Debiec, Pierre Ronco, Guillaume Perry   +5 more
wiley   +1 more source

Near-colorings: non-colorable graphs and NP-completeness [PDF]

, 2013
A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core  

The Weisfeiler-Leman Dimension of Planar Graphs is at most 3

, 2017
We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables.
Kiefer, Sandra, Ponomarenko, Ilia, Schweitzer, Pascal   +2 more
core   +1 more source