Amanote Research

Amanote Research

    RegisterSign In

Matching and Stable Cutsets in Graphs.

doi 10.22215/etd/1987-01327
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
Augustine Moshi
Publisher

Carleton University


Related search

Clique-Cutsets Beyond Chordal Graphs

Journal of Graph Theory
GeometryTopology
2018English

Decomposition of Odd-Hole-Free Graphs by Double Star Cutsets and 2-Joins

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

On Tight Cuts in Matching Covered Graphs

Journal of Combinatorics
2018English

Pattern Matching in Protein-Protein Interaction Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Perfect Matching and Circuit Cover of Graphs

English

Parallel Maximum Matching Algorithms in Interval Graphs

International Journal of Foundations of Computer Science
Computer Science
1999English

Matching Dominating Sets of Interval Graphs

International Journal of Computer Applications
2014English

Efficient Matching of Dynamically Changing Graphs

Theory and Applications of Image Analysis
1992English

Terminal Backup, 3D Matching, and Covering Cubic Graphs

2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy