Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings

Vadim E. Levit; Eugen Mǎndrescu

doi:10.1016/s0166-218x(03)00398-6

ScienceGate Book Chapters

JOURNAL ARTICLE

Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings

Vadim E. Levit Eugen Mǎndrescu

Year: 2003 Journal: Discrete Applied Mathematics Vol: 132 (1-3)Pages: 163-174 Publisher: Elsevier BV

DOI: 10.1016/s0166-218x(03)00398-6

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Bipartite graph Vertex (graph theory) Induced subgraph Independent set Matching (statistics) Factor-critical graph Graph Set (abstract data type) Discrete mathematics Line graph Graph power

Metrics

Cited By

0.71

FWCI (Field Weighted Citation Impact)

Refs

0.67

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings

Metrics

Citation History

Topics

Related Documents

Approximating maximum uniquely restricted matchings in bipartite graphs

Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings

On Unicyclic Graphs with Uniquely Restricted Maximum Matchings

Unicycle graphs and uniquely restricted maximum matchings

Computing Maximum Uniquely Restricted Matchings In Restricted Interval Graphs