scientific article; zbMATH DE number 969113

DOI10.1002/(SICI)1097-0118(199612)23:4%3C355::AID-JGT4%3E3.0.CO;2-QzbMATH Open0865.05059MaRDI QIDQ5284582FDOQ5284582

Kara Lee Walcher

Publication date: 29 June 1997

Title of this publication is not available (Why is that?)

zbMATH Keywords

perfect matchinggraph powers\(n\)-connected\(n\)-extendible

Mathematics Subject Classification ID

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

Cited In (4)

• The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
• Title not available (Why is that?)
• Matching extension and the genus of a graph
• N‐extendability of symmetric graphs

   Recommendations

• A result on extendibility in the powers of graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Matchings and matching extensions in graphs 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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