Results 231 to 240 of about 266,730 (262)
Some of the next articles are maybe not open access.
Induced matching extendable graphs
Journal of Graph Theory, 1998Summary: We say that a simple graph \(G\) is induced matching extendable, shortly IM-extendable, if every induced matching of \(G\) is included in a perfect matching of \(G\). The main results of this paper are as follows: (1) For every connected IM-extendable graph \(G\) with \(| V(G)|\geq 4\), the girth \(g(G)\leq 4\).
exaly +3 more sources
Observation of electromagnetically induced phase matching
Optics Letters, 1993We report the observation of electromagnetically induced phase matching in collisionally broadened Pb vapor. At a critical intensity at which the Rabi frequency of a dressing 1064-nm laser overcomes the Doppler broadening of the vapor, the generated four-frequency-mixing signal at 283 nm increases in a steplike manner by a factor of 59.
G Y Yin
exaly +3 more sources
Maximum Induced Matching of Hexagonal Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erveš, Rija, Šparl, Petra
exaly +3 more sources
Number of Induced Matchings of Graphs
Acta Mathematicae Applicatae Sinica, English Series, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Yan, Liu, Yan
openaire +1 more source
Induced matchings in cubic graphs
Journal of Graph Theory, 1993AbstractIn this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdös and Nešetřil: For each d ≥ 3, the edge set of a graph of maximum degree d can always be partitioned into [5d2/4] subsets each of ...
Peter Horák +2 more
openaire +2 more sources
Approximating weighted induced matchings
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Chih Lin +2 more
openaire +3 more sources

