Results 81 to 90 of about 3,864 (298)
Judicious k-partitions of graphs [PDF]
, 2009 Judicious partition problems ask for partitions of the vertex set of graphs so that several quantities are optimized simultaneously. In this paper, we answer the following judicious partition question of Bollobás and Scott [B. Bollobás, A.D.
Xu, Baogang, Yu, Xingxing
core +1 more source
Convex p-partitions of bipartite graphs [PDF]
, 2016 Artículo de publicación ISIA set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p >= 1, all partitions of the vertex set of a bipartite graph into p convex sets can ...
Safe, Martín D. +3 more
core +3 more sources
Approximation algorithms for the partition vertex cover problem
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suman Kalyan Bera +3 more
openaire +2 more sources
E. coli Extracellular Matrix: A Tunable Composite With Hierarchical Structure
Advanced Materials, EarlyView.The complex composite‐like mechanical behavior of E. coli biofilm matrix is the result of a synergic contribution of the rigid curli and swelling pEtN‐cellulose, and emerges from specific ratio and assembly conditions. The interactions between the two fibers govern biofilm hydration and characteristic wrinkling patterns, providing crucial insights for ...
Macarena Siri +7 more
wiley +1 more source
VERTEX PARTITIONS OF CHORDAL GRAPHS [PDF]
, 2008 . A k-tree is a chordal graph with no (k + 2)-clique. An ℓ-treepartition of a graph G is a vertex partition of G into ‘bags’, such that con-tracting each bag to a single vertex gives an ℓ-tree (after deleting loops and replacing parallel edges by a ...
David R. Wood
core
A new perspective on vertex connectivity [PDF]
, 2013 Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity, our knowledge in the case of vertex connectivity is much ...
Kuhn, Fabian +5 more
core +1 more source
Measures and generalizations of dual Littlewood identities
Forum of Mathematics, SigmaWe introduce three families of vectors |λ―so⟩ $|\underline {\lambda }^{so}\rangle $ vertical bar lamda underbar Superscript s o Baseline right angle bracket , |λ―sp⟩ $|\underline {\lambda }^{sp}\rangle $ vertical bar lamda underbar Superscript s
Zhongren Cai +4 more
doaj +1 more source
Advanced Materials, EarlyView.In this work, we introduce ancillary‐ligand‐mediated growth control of ultrathin CsPbI3 PeNPLs to achieve highly uniform thickness and reduced agglomeration. Strong ancillary‐ligand coordination to the perovskite surface regulates nucleation and improves surface passivation, enabling color‐pure emission and preferentially oriented superlattices.
Jongbeom Kim +23 more
wiley +1 more source
The three-dimensional art gallery problem and its solutions [PDF]
, 2012 This thesis addressed the three-dimensional Art Gallery Problem (3D-AGP), a version of the art gallery problem, which aims to determine the number of guards required to cover the interior of a pseudo-polyhedron as well as the placement of these guards ...
Jefri Marzal, Marzal, Jefri
core +1 more source
Splitting Plane Graphs to Outerplanarity
Journal of Graph Algorithms and ApplicationsVertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often planarity, for ...
Martin Gronemann +2 more
doaj +1 more source