Matching extension in prism graphs

DOI10.1016/j.dam.2016.12.017zbMath1357.05120OpenAlexW2575760535MaRDI QIDQ512532

R. E. L. Aldred, Michael D. Plummer

Publication date: 27 February 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.12.017

zbMATH Keywords

matchingmatching extensionfactor-criticalprism graph\(E(m,n)\)bicritical

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Extendability and criticality in matching theory ⋮ The extendability of Cayley graphs generated by transpositions ⋮ The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On n-extendable graphs
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• Extending matchings in graphs: A survey
• How to build a brick
• Generating bricks
• K ₄ -free and C6¯-free Planar Matching Covered Graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• Recent Progress in Matching Extension
• Graph Factors and Matching Extensions
• Hamilton cycles in prisms
• Prism‐hamiltonicity of triangulations

This page was built for publication: Matching extension in prism graphs