Maximum matchings in a regular graph of specified connectivity and bounded order

DOI10.1002/jgt.3190110109zbMath0614.05044OpenAlexW2065707882MaRDI QIDQ4722104

P. Katerinis

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1002/jgt.3190110109

zbMATH Keywords

perfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Cut-edges and regular factors in regular graphs of odd degree ⋮ Matching and edge-connectivity in regular graphs ⋮ A complete description of convex sets associated with matchings and edge‐connectivity in graphs ⋮ On the perfect matchings of near regular graphs ⋮ Matching and edge-connectivity in graphs with given maximum degree

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum matchings in a regular graph of specified connectivity and bounded order