Edge proximity conditions for extendability in regular bipartite graphs

DOI10.1002/JGT.22961zbMATH Open1522.05074MaRDI QIDQ6094028FDOQ6094028

Authors: R. E. L. Aldred, Bill Jackson, Michael D. Plummer 

Publication date: 9 October 2023

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

Recommendations

• Edge proximity conditions for extendability in cubic bipartite graphs
• scientific article; zbMATH DE number 19207
• scientific article; zbMATH DE number 6001476
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• Perfect matchings in regular bipartite graphs

zbMATH Keywords

matching extensionforbidden configurationdistance restricted matching extension

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• On n-extendable graphs
• Title not available (Why is that?)
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Edge proximity conditions for extendability in cubic bipartite graphs

Cited In (5)

• Edge Proximity Conditions for Extendability in Planar Triangulations
• Edge proximity and matching extension in projective planar graphs
• Essential Constraints of Edge-Constrained Proximity Graphs
• Distance matching extension in cubic bipartite graphs
• Edge proximity conditions for extendability in cubic bipartite graphs

This page was built for publication: Edge proximity conditions for extendability in regular bipartite graphs

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