Results 101 to 110 of about 2,245,805 (347)
Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs [PDF]
, 2023 Lucas Magee, Yusu Wang
openalex +1 more source
Advanced Functional Materials, EarlyView.This review explores functional and responsive materials for triboelectric nanogenerators (TENGs) in sustainable smart agriculture. It examines how particulate contamination and dirt affect charge transfer and efficiency. Environmental challenges and strategies to enhance durability and responsiveness are outlined, including active functional layers ...
Rafael R. A. Silva +9 more
wiley +1 more source
Advanced Functional Materials, EarlyView.This work presents the first example of multifunctional protein eutectogels based on a tannic acid: betaine low‐transition‐temperature mixture, exhibiting elastomeric behavior, strong adhesion to various substrates, including biological tissues, and notable anti‐inflammatory properties derived from the natural polyphenol and zwitterion.
Sergio Martin‐Saldaña +8 more
wiley +1 more source
Ice Lithography: Recent Progress Opens a New Frontier of Opportunities
Advanced Functional Materials, EarlyView.This review focuses on recent advancements in ice lithography, including breakthroughs in compatible precursors and substrates, processes and applications, hardware, and digital methods. Moreover, it offers a roadmap to uncover innovation opportunities for ice lithography in fields such as biological, nanoengineering and microsystems, biophysics and ...
Bingdong Chang +9 more
wiley +1 more source
On H-antimagic decomposition of toroidal grids and triangulations
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a finite simple graph with p vertices and q edges. A decomposition of a graph G into isomorphic copies of a graph H is called (a, d)-H-antimagic if there is a bijection such that for all subgraphs isomorphic to H in the decomposition of G, the sum
Hendy +4 more
doaj +1 more source
Le Matematiche, 1990 Summary: This paper surveys some recent results and new techniques concerning edge-disjoint decompositions of \(K_ n\) into copies of \(G\), where \(G\) may be a cycle, a path, or just a small graph. Additional properties of such a decomposition are considered, such as nestings, resolvability, \(i\)-perfect decompositions and self-complementary ...
openaire +2 more sources
Triangle decompositions of planar graphs
Discussiones Mathematicae Graph Theory, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mynhardt Christina M. +1 more
openaire +2 more sources
Advanced Functional Materials, EarlyView.3D porous carbons with tunable density are crucial for energy storage, separations, and load‐bearing applications; however, their fabrication is often constrained by shrinkage during pyrolysis. This study optimizes and demonstrates the versatility of a template–coating pair strategy, producing materials that largely retain their shape and hierarchical ...
Adarsh Suresh +7 more
wiley +1 more source
Decomposing Berge graphs and detecting balanced skew partitions [PDF]
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs.
Nicolas Trotignon
core
Minimum H-decompositions of graphs
Journal of Combinatorial Theory, Series B, 2007 Given graphs \(G\) and \(H\), an \(H\)-decomposition of \(G\) is a partition of the edge set of \(G\) such that each part is either a single edge or forms a graph isomorphic to \(H\). Let \(\varphi_H(n)\) be the smallest number \(\varphi\) such that any graph \(G\) of order \(n\) admits an \(H\)-decomposition with at most \(\varphi\) parts.
Pikhurko, Oleg, Sousa, Teresa
openaire +1 more source