Scilit logo
  • Rankings
  • Search Publications
    Cited-by Search
  • Sources
  • Publishers
  • Scholars
    Top Cited Scholars
  • Organizations
  • Scilit
    About Us
    Advisory Board
    Data Sources
    Career
    Support / Contact
    User Guide
    Publisher User
    Search Function
    Rankings Function
    API Resource
    Scilit Knowledge
    Metrics
    Scilit Recognitions
    Publications Classification
    Media
    News
    Blog
Register
  1. Home
  2. Publications
  3. Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size
  1. Home
  2. Publications
  3. Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size

Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size

Authors:
  • DKDaniel Kobler
    Daniel Kobler
  • URUdi Rotics
    Udi Rotics

Publisher website
Google Scholar
  • 28 May 2003
    • journal article
    • Published by Springer Nature in Algorithmica
    • Vol. 37  (4) , 327-346
    • DOI:10.1007/s00453-003-1035-4
Abstract
No abstract available
Keywords
  • INDUCED MATCHING
  • LINE-GRAPHS
  • CLAW-FREE GRAPHS
  • BULL
  • REGULAR GRAPHS
  • POLYNOMIAL ALGORITHMS
Cited by 118 articles
Scilit logo

Have questions? Email us at support@scilit.com

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.

MDPI initiatives

  • MDPI Journals
  • MDPI Books
  • Sciforum
  • Proceedings Series
  • Preprints.org
  • SciProfiles
  • Encyclopedia
  • JAMS

Legal

  • Privacy
  • Terms
  • About
  • Contact
  • Disclaimer

Follow us

  • facebook icon
  • x icon
  • linkedin icon

Join us

  • Career

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.