Results 11 to 20 of about 266,730 (262)
Induced Matchings in Subcubic Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2014 We prove that a cubic graph with $m$ edges has an induced matching with at least $m/9$ edges. Our result generalizes a result for planar graphs due to Kang, Mnich, and Müller (Induced matchings in subcubic planar graphs, SIAM J. Discrete Math. 26 (2012) 1383-1411) and solves a conjecture of Henning and Rautenbach (Induced matchings in subcubic graphs ...
Felix Joos +2 more
openaire +2 more sources
Optically Induced Nonlinear Cubic Crystal System for 3D Quasi‐Phase Matching
Advanced Photonics Research, 2022 Quasi‐phase matching (QPM) is a technique in nonlinear optics for achieving efficient energy exchange among optical waves at different frequencies, by spatially modulating the quadratic nonlinearity (χ (2)) of the medium. To realize the full potential of
Yesheng Chen +9 more
doaj +1 more source
Stem Cell Research & Therapy, 2021 Background iPSC (induced pluripotent stem cells) banks of iPSC lines with homozygous HLA (human leukocyte antigen) haplotypes (haplobanks) are proposed as an affordable and off-the-shelf approach to allogeneic transplantation of iPSC derived cell ...
Belén Álvarez-Palomo +21 more
doaj +1 more source
Finding Dominating Induced Matchings in P9-Free Graphs in Polynomial Time
Discussiones Mathematicae Graph Theory, 2022 Let G = (V, E) be a finite undirected graph. An edge subset E′ ⊆ E is a dominating induced matching (d.i.m.) in G if every edge in E is intersected by exactly one edge of E′. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m.
Brandstädt Andreas, Mosca Raffaele
doaj +1 more source
Discrete Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelika Steger, Min-Li Yu
openaire +2 more sources
Some Results on Dominating Induced Matchings
Graphs and Combinatorics, 2022 Let $G$ be a graph, a dominating induced matching (DIM) of $G$ is an induced matching that dominates every edge of $G$. In this paper we show that if a graph $G$ has a DIM, then $χ(G) \leqslant 3$. Also, it is shown that if $G$ is a connected graph whose all edges can be partitioned into DIM, then $G$ is either a regular graph or a biregular graph and ...
Saieed Akbari +4 more
openaire +3 more sources
Matching Extendabilities of G = Cm ∨ Pn
Mathematics, 2019 A graph is considered to be induced-matching extendable (bipartite matching extendable) if every induced matching (bipartite matching) of G is included in a perfect matching of G. The induced-matching extendability and bipartite-matching extendability of
Zhi-hao Hui +3 more
doaj +1 more source
A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
Journal of Graph Algorithms and Applications, 2018 Circle graphs have applications to RNA bioinformatics, computational chemistry, and VLSI design. Additionally, many problems that are intractable on general graphs are efficient for circle graphs.
Max Ward +3 more
doaj +1 more source
On Distance-3 Matchings and Induced Matchings
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Brandstadt, MOSCA, Raffaele
openaire +3 more sources