Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph

DOI10.1002/jgt.21883zbMath1339.05306OpenAlexW1917290672MaRDI QIDQ2811193

Michitaka Furuya, Yoshimi Egawa

Publication date: 10 June 2016

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

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

zbMATH Keywords

extendabilityperfect matchingforbidden subgraphs

Mathematics Subject Classification ID

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

Related Items (1)

Perfect matchings avoiding prescribed edges in a star-free graph

Cites Work

• Unnamed Item
• On matching extensions with prescribed and proscribed edge sets. II
• Matchings and matching extensions in graphs
• Forbidden induced subgraphs for perfect matchings
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• A pair of forbidden subgraphs and perfect matchings.
• Perfect matchings avoiding prescribed edges in a star-free graph
• Forbidden triples for perfect matchings
• 1-Factors and Antifactor Sets
• Forbidden subgraphs and bounds on the size of a maximum matching

This page was built for publication: Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph