• Title of article

    On complexity of special maximum matchings constructing Original Research Article

  • Author/Authors

    R.R. Kamalian، نويسنده , , V.V. Mkrtchyan، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2008
  • Pages
    9
  • From page
    1792
  • To page
    1800
  • Abstract
    For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper) bound for the cardinality of its maximum matching.
  • Keywords
    Maximum Matching , Bipartite graph , NP-completeness
  • Journal title
    Discrete Mathematics
  • Serial Year
    2008
  • Journal title
    Discrete Mathematics
  • Record number

    947262

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=947262