On Tight Cuts in Matching Covered Graphs

Journal of Combinatorics
doi 10.4310/joc.2018.v9.n1.a8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

International Press of Boston

Related search

Maximum Cuts in Edge-Colored Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

On Constructing Some Strongly Well-Covered Graphs

1991English

Sparsest Cuts and Concurrent Flows in Product Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

Efficient Shape Matching via Graph Cuts

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Tight Bounds for Testing Bipartiteness in General Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Weighted Well-Covered Graphs and Complexity Questions

Moscow Mathematical Journal
Mathematics
2004English

Matching and Stable Cutsets in Graphs.

English

Pattern Matching in Protein-Protein Interaction Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Efficient Subgraph Matching on Large RDF Graphs Using MapReduce

Data Science and Engineering
Computational MechanicsComputer Science Applications
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy