On the Kőnig‐Egerváry theorem for ‐paths

DOI10.1002/jgt.22421zbMath1414.05218arXiv1710.07748OpenAlexW2903729012MaRDI QIDQ5379839

Dieter Rautenbach, Stéphane Bessy, Pascal Ochem

Publication date: 14 June 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.07748

zbMATH Keywords

bipartite graphmatchingvertex cover\(k\)-path vertex coverKőnig-Egerváry theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Relating dissociation, independence, and matchings

This page was built for publication: On the Kőnig‐Egerváry theorem for ‐paths