scientific article; zbMATH DE number 969113

DOI10.1002/(SICI)1097-0118(199612)23:4%3C355::AID-JGT4%3E3.0.CO;2-QMaRDI QIDQ5284582zbMATH OpenFDO

Authors Kara Lee Walcher

Publication date 29 June 1997

Full work available at URL https://doi.org/10.1002/(SICI)1097-0118(199612)23:4%3C355::AID-JGT4%3E3.0.CO;2-Q

zbMATH Keywords

\(n\)-connected\(n\)-extendiblegraph powersperfect matching

Mathematics Subject Classification ID

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

Recommendations

• A result on extendibility in the powers of graphs
• scientific article; zbMATH DE number 786151
• Matchings and matching extensions in graphs
• scientific article; zbMATH DE number 867631

Cited in

(7)

• Matching extension and the genus of a graph
• The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
• scientific article; zbMATH DE number 6007655 (Why is no real title available?)
• N‐extendability of symmetric graphs
• scientific article; zbMATH DE number 867631 (Why is no real title available?)
• scientific article; zbMATH DE number 4193713 (Why is no real title available?)
• A result on extendibility in the powers of graphs

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)