Results 31 to 40 of about 67,442 (263)

Bichromatic Perfect Matchings with Crossings

open access: yes, 2023
Appears in the Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)
Oswin Aichholzer   +4 more
openaire   +2 more sources

Even cycles and perfect matchings in claw-free plane graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
Lov{\'a}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfect matching.
Shanshan Zhang   +2 more
doaj   +1 more source

Conditional Strong Matching Preclusion of the Alternating Group Graph

open access: yesTheory and Applications of Graphs, 2019
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj   +1 more source

Designs of Branch-Line Couplers by Considering the Parasitic Effects of P-I-N Diodes

open access: yesIEEE Access, 2020
Branch-line couplers (BLCs) are commonly used in the wireless systems. To achieve reconfigurable applications, switchable BLCs with p-i-n diodes can be used.
Pu-Hua Deng   +6 more
doaj   +1 more source

On the number of perfect matchings in random polygonal chains

open access: yesOpen Mathematics, 2023
Let GG be a graph. A perfect matching of GG is a regular spanning subgraph of degree one. Enumeration of perfect matchings of a (molecule) graph is interest in chemistry, physics, and mathematics.
Wei Shouliu   +3 more
doaj   +1 more source

Cycles and perfect matchings

open access: yesDiscrete Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Haglund, Jeffrey B. Remmel
openaire   +2 more sources

Dyck tilings, linear extensions, descents, and inversions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths.
Jang Soo Kim   +3 more
doaj   +1 more source

Circulating microRNA signatures of cachexia and cancer in Canis familiaris as a comparative oncology model for human disease

open access: yesMolecular Oncology, EarlyView.
Circulating microRNAs as biomarkers of cachexia and sex‐specific cancer in senior dogs. In 25 client‐owned dogs, four circulating miRNAs (miR‐15a, miR‐15b, miR‐16, miR‐140) were downregulated in cachexia, with miR‐16 the strongest individual biomarker (AUC = 0.899).
Soon‐Seok Park   +6 more
wiley   +1 more source

A Maximum Resonant Set of Polyomino Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
A polyomino graph P is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square.
Zhang Heping, Zhou Xiangqian
doaj   +1 more source

Perfect matchings and perfect squares

open access: yesJournal of Combinatorial Theory, Series A, 1994
The author investigates (perfect) matchings of a large class of graphs with 4-fold rotational symmetry. It is proved by mostly combinatorial arguments that the number of such matchings is always a square or double a square. This result has an interesting application to tilings by dominoes.
openaire   +3 more sources

Home - About - Disclaimer - Privacy