On the 2-extendability of planar graphs

DOI10.1016/0012-365X(91)90227-SzbMath0751.05062OpenAlexW2014690896MaRDI QIDQ1186375

Dingjun Lou, Derek Holton, Michael D. Plummer

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90227-s

zbMATH Keywords

planar graphsextendability

Mathematics Subject Classification ID

Graph theory (05C99) Connectivity (05C40)

Related Items

CYCLIC CONNECTIVITY OF STAR GRAPH ⋮ Super cyclically edge-connected vertex-transitive graphs of girth at least 5 ⋮ Super-cyclically edge-connected regular graphs ⋮ Extending matchings in planar graphs. V ⋮ Note on reliability of star graphs ⋮ Perfect matchings in highly cyclically connected regular graphs ⋮ Super cyclically edge connected transitive graphs ⋮ Distance-restricted matching extendability of fullerene graphs ⋮ Extending matchings in planar graphs. IV ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ Characterization of graphs with infinite cyclic edge connectivity ⋮ Atoms of cyclic edge connectivity in regular graphs ⋮ On the extendability of bi-Cayley graphs of finite abelian groups ⋮ Extending matchings in graphs: A survey

Cites Work

• Girth in graphs
• Matching theory
• On n-extendable graphs
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• Parallel concepts in graph theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item