Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
Polarization-Multiplexed Metalens Enables Switchable and Compact Chromatic Confocal Sensing with Dual-Mode Precision Control. [PDF]
Zhao Z +5 more
europepmc +1 more source
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
Effect of Acidification on the Properties of Films Developed from Carboxymethylcellulose and Jabuticaba Anthocyanin Extract (<i>Plinia Cauliflora</i>). [PDF]
Ponciano CDS, de Oliveira CP.
europepmc +1 more source
Explicit 3‐colorings for Exponential Graphs
ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento +2 more
wiley +1 more source
Urban color in public design: a review of spatial aesthetics and behavioral impact in Chinese and South Korean cities using structural equation modelling approaches. [PDF]
Yu H, Liu R, Kumar R, Singh S, Kumar R.
europepmc +1 more source
Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3
ABSTRACT In the flexible list coloring problem, we consider a graph G $G$ and a color list assignment L $L$ on G $G$, as well as a subset U ⊆ V ( G ) $U\subseteq V(G)$ for which each u ∈ U $u\in U$ has a preferred color p ( u ) ∈ L ( u ) $p(u)\in L(u)$. Our goal is to find a proper L $L$‐coloring ϕ $\phi $ of G $G$ such that ϕ ( u ) = p ( u ) $\phi (u)=
Richard Bi, Peter Bradshaw
wiley +1 more source
Evaluation of the Alterability of Natural and Artificial Agglomerated Stones Produced in Epoxy Matrix. [PDF]
Castilho EDF +6 more
europepmc +1 more source
Path Degeneracy and Applications
ABSTRACT In this work, we relate girth and path‐degeneracy in classes with sub‐exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor‐closed classes that are tight up to a constant factor (and tight up to second order terms if a classical conjecture on existence of g $g$‐cages is verified). As an application,
Yuquan Lin, Patrice Ossona de Mendez
wiley +1 more source
Compound Meta-Optics for Advanced Optical Engineering. [PDF]
Lee HR, Kim D, Kim SJ.
europepmc +1 more source

