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

DOI10.1002/JGT.21883zbMATH Open1339.05306OpenAlexW1917290672MaRDI QIDQ2811193FDOQ2811193

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

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

zbMATH Keywords

perfect matchingextendabilityforbidden subgraphs

Mathematics Subject Classification ID

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

Cites Work

• A pair of forbidden subgraphs and perfect matchings.
• 1-Factors and Antifactor Sets
• Forbidden subgraphs and bounds on the size of a maximum matching
• Forbidden induced subgraphs for perfect matchings
• On matching extensions with prescribed and proscribed edge sets. II
• Matchings and matching extensions in graphs
• Title not available (Why is that?)
• Forbidden triples 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

Cited In (2)

• Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs
• Perfect matchings avoiding prescribed edges in a star-free graph

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)