A Complementation Theorem for Perfect Matchings of Graphs Having a Cellular Completion

Journal of Combinatorial Theory - Series A - United States
doi 10.1006/jcta.1997.2799
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

The Number of Disjoint Perfect Matchings in Semi-Regular Graphs

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2017English

Ordering of Unicyclic Graphs With Perfect Matchings by Minimal Matching Energies

Open Journal of Discrete Mathematics
2019English

Extending Matchings in Graphs: A Survey

1990English

NC Algorithms for Computing the Number of Perfect Matchings in K 3,3-Free Graphs and Related Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1988English

A Class of Weakly Perfect Graphs

Czechoslovak Mathematical Journal
Mathematics
2010English

A Separator Theorem for Chordal Graphs

SIAM Journal on Algebraic Discrete Methods
1984English

Matchings in Geometric Graphs

English

Finding Perfect Matchings in Dense Hypergraphs

2020English

The Completion of a Theorem of Kantor

Bulletin of the American Mathematical Society
1944English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy