Results 91 to 100 of about 757,662 (296)
On the planarity of jump graphs
Discrete Mathematics, 2000 Let \(G\) be a graph of size \(m\geq 1\) and let \(F\) and \(H\) be edge-induced subgraphs of \(G\) of size \(k\) with \(1\leq k\leq m\). In the literature is then defined the \(k\)-jump distance from \(F\) to \(H\). For a graph \(G\) of size \(m\geq 1\) and an integer \(k\) with \(1\leq k\leq m\), the \(k\)-jump graph \(J_k(G)\) is defined as a graph ...
Héctor Hevia +2 more
openaire +2 more sources
Planar hypohamiltonian oriented graphs
, 2022 In 1978 Thomassen asked whether planar hypohamiltonian oriented graphs exist. Infinite families of such graphs have since been described but for infinitely many n it remained an open question whether planar hypohamiltonian oriented graphs of order n ...
Zamfirescu, Carol +4 more
core +1 more source
Bio‐Inspired Artificial Ionic Mechanoreceptor
Advanced Functional Materials, EarlyView.A skin‐inspired artificial mechanoreceptor based on ionic interactions is presented for biomimetic tactile sensing. Pressure‐driven ionic redistribution within microfluidic channels generates a self‐powered electrical signal without external bias. The generated waveform exhibits mechanoreceptor‐like temporal features, including overshoot and undershoot,
Mohammad Akbari +4 more
wiley +1 more source
Advanced Functional Materials, EarlyView.This study advances SafeWax, a bio‐inspired, fatty‐acids‐based superhydrophobic coating, by identifying an agriculturally compliant solvent and revealing how solvent‐controlled Fatty acid crystallization governs the coating's microscopic structure and performance.
Niv Ben‐Arie +13 more
wiley +1 more source
Crossing Numbers of Beyond-Planar Graphs
, 2019 We study the 1-planar, quasi-planar, and fan-planar crossing number in comparison to the (unrestricted) crossing number of graphs. We prove that there are n-vertex 1-planar (quasi-planar, fan-planar) graphs such that any 1-planar (quasi-planar, fan ...
Montecchiani F. +3 more
core +1 more source
Testing first-order properties for subclasses of sparse graphs [PDF]
, 2013 We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez.
Thomas, Robin +2 more
core +1 more source
Advanced Functional Materials, EarlyView.Cell therapies typically rely on cold‐chain logistics and cryopreservation, limiting access and compromising cell quality. Here, a dual‐chamber device separates an oxygen‐supplying chamber from a hyaluronic acid cargo chamber, sustaining oxygen delivery for over 70 h and enabling ambient‐temperature shipment.
Daniel A. Domingo‐Lopez +9 more
wiley +1 more source
Testing Simultaneous Planarity when the Common Graph is 2-Connected
Journal of Graph Algorithms and Applications, 2013 Two planar graphs G1 and G2 sharing some vertices and edges are simultaneously planar if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings.
Bernhard Haeupler +2 more
doaj +1 more source
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs. [PDF]
Comput Intell Neurosci, 2021 Liang Z, Wei H.
europepmc +1 more source
On the reconstruction of planar graphs
Journal of Combinatorial Theory, Series B, 2007 AbstractWe show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs.
Mark Bilinski +2 more
openaire +1 more source