Results 51 to 60 of about 27,053 (309)
We define biequivalent planar graphs, which are a generalisation of the uniform polyhedron graphs, as planar graphs made out of two families of equivalent nodes.
Bernard Piette
doaj +1 more source
On planar hypohamiltonian graphs
Summary: We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer \(N\), such that for every integer \(n\geq N\) there exists a ...
Wiener, Gabor, Araya, Makoto
openaire +3 more sources
On Weak Flexibility in Planar Graphs
Recently, Dvořák, Norin, and Postle introduced flexibility as an extension of list coloring on graphs (J Graph Theory 92(3):191–206, 2019, https://doi.org/10.1002/jgt. 22447).
Murphy, Kyle +3 more
core
Acyclic 4-choosability of planar graphs without 4-cycles [PDF]
summary:A proper vertex coloring of a graph $G$ is acyclic if there is no bicolored cycle in $G$. In other words, each cycle of $G$ must be colored with at least three colors.
Sun, Yingcai, Chen, Min
core +1 more source
Every Planar Graph with the Distance of 5−-Cycles at Least 3 from Each Other Is DP-3-Colorable
DP-coloring was introduced by Dvořák and Postle [J. Comb. Theory Ser. B 2018, 129, 38–54]. In this paper, we prove that every planar graph in which the 5−-cycles are at distance of at least 3 from each other is DP-3-colorable, which improves the result ...
Yueying Zhao, Lianying Miao
doaj +1 more source
Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski +12 more
wiley +1 more source
ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang +10 more
wiley +1 more source
The nonsolvability by radicals of generic 3-connected planar Laman graphs. [PDF]
We show that planar embeddable -connected Laman graphs are generically non-soluble. A Laman graph represents a configuration of points on the Euclidean plane with just enough distance specifications between them to ensure rigidity.
Power, Stephen C., Owen, J. C.
core
Planar hypohamiltonian oriented graphs [PDF]
In 1978 Thomassen asked whether planar hypohamiltonian oriented graphs exist. Infinite families of such graphs have since been described but for infinitely many it remained an open question whether planar hypohamiltonian oriented graphs of order exist ...
Burger, Alewyn P. +4 more
core +1 more source
Planar lattices and planar graphs
AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
openaire +2 more sources

