Matching & Covering

Santosh Kumar Yadav ()
Additional contact information
Santosh Kumar Yadav: Shri Jagdishprasad Jhabarmal Tibrewala University

Chapter Chapter 5 in Advanced Graph Theory, 2023, pp 141-170 from Springer

Abstract: Abstract If we are given a graph and are asked to find in it as many independent edges as possible. How would we go about this? Will we be able to pair up all its vertices in this way? If not, how can we be sure that this is indeed impossible? Somewhat surprisingly, this basic problem does not only lie at the heart of numerous applications, it also gives rise to some rather interesting graph theory.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-22562-8_5

Ordering information: This item can be ordered from
http://www.springer.com/9783031225628

DOI: 10.1007/978-3-031-22562-8_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().