Results 51 to 60 of about 38,199 (317)
Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4
The famous Wegner's Planar Graph Conjecture asserts tight upper bounds on the chromatic number of the square G2 of a planar graph G, depending on the maximum degree Δ(G) of G. The only case that the conjecture is resolved is when Δ(G)=3, which was proven
Cho, Eun-Kyung +2 more
core +1 more source
Triangle-Free Planar Graphs as Segment Intersection Graphs [PDF]
We prove that every triangle-free planar graph is the intersection graph of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and oblique) and in such a way that no two segments cross ...
Cobos Gavala, Javier +4 more
core +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
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
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
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
Computing Planarity in Computable Planar Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire +2 more sources
Posets and planar graphs [PDF]
AbstractUsually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [t − 1 ↕ t], thought to be between t − 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most [2↕3].
Stefan Felsner, William T. Trotter
openaire +1 more source
This study presents a reversible temperature sensor with high switching ratio, ∼103. The device is fabricated using PET‐ITO and carbon nanotube dispersions in alkane. Considering its application in cold chain logistics, a proof‐of‐concept with LED is showcased. Thus, a temperature drop below the threshold temperature (crystallization temperature of the
Sunil Kumar Behera +8 more
wiley +1 more source
Homomorphisms of planar signed graphs to signed projective cubes [PDF]
We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g1.
Reza Naserasr +2 more
doaj +1 more source

