Equality of distance packing numbers

DOI10.1016/j.disc.2015.06.003zbMath1318.05059arXiv1402.6129OpenAlexW1581152400MaRDI QIDQ2515579

Felix Joos, Dieter Rautenbach

Publication date: 5 August 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matchingpackingindependent setinduced matching

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 (7)

Girth, minimum degree, independence, and broadcast independence ⋮ Exponential independence ⋮ On the hardness of deciding the equality of the induced and the uniquely restricted matching number ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs ⋮ On some hard and some tractable cases of the maximum acyclic matching problem

Cites Work

• On distance-3 matchings and induced matchings
• Matching theory
• NP-completeness of some generalizations of the maximum matching problem
• Induced matchings
• Induced matchings in asteroidal triple-free graphs
• Induced matchings in intersection graphs.
• 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 a maximum induced matching in weakly chordal graphs
• New results on maximum induced matchings in bipartite graphs and beyond
• New results on induced matchings
• Maximum induced matchings close to maximum matchings
• The graphs with maximum induced matching and maximum matching the same size

This page was built for publication: Equality of distance packing numbers