Perfect matchings avoiding several independent edges in a star-free graph

DOI10.1002/JGT.21883MaRDI QIDQ2811193zbMATH OpenOpenAlexFDO

Authors Yoshimi Egawa, Michitaka Furuya

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

perfect matchingextendabilityforbidden subgraphs

Mathematics Subject Classification ID

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

Recommendations

• Perfect matchings avoiding prescribed edges in a star-free graph
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden induced subgraphs for perfect matchings
• Forbidden triples for perfect matchings

Cites work

• scientific article; zbMATH DE number 874216 (Why is no real title available?)
• 1-Factors and Antifactor Sets
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden induced subgraphs for perfect matchings
• Forbidden subgraphs and bounds on the size of a maximum matching
• Forbidden triples for perfect matchings
• Matchings and matching extensions in graphs
• On matching extensions with prescribed and proscribed edge sets. II
• Perfect matchings avoiding prescribed edges in a star-free graph

Cited in

(4)

• Forbidden induced subgraphs for perfect matchings
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• Perfect matchings avoiding prescribed edges in a star-free graph
• Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs

This page was built for publication: Perfect matchings avoiding several independent edges in a star-free graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811193)