Planar cycle-extendable graphs

DOI10.46298/DMTCS.13929MaRDI QIDQ6876002zbMATH OpenFDO

Authors Aditya Y Dalwadi, Kapil R Shenvi Pause, Ajit A. Diwan, Nishad Kothari

Publication date 13 January 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.13929

zbMATH Keywords

cycle-extendabilitymatching covered graphsmatchingsperfect matchings

Mathematics Subject Classification ID

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

Cites work

• 2-isomorphic graphs.
• \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs
• A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs
• A characterization of convertible (0,1)-matrices
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Critically n-Connected Graphs
• Extending matchings in graphs: A survey
• Generating bricks
• Graph theory
• How to build a brick
• Matching structure and the matching lattice
• Matching theory
• On cycle-nice claw-free graphs
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• Perfect matchings. A theory of matching covered graphs (to appear)
• Permanents, Pfaffian orientations, and even directed circuits
• Pólya's permanent problem
• Reducible chains of planar 1-cycle resonant graphs
• Thin edges in braces
• Vector spaces and the Petersen graph

This page was built for publication: Planar cycle-extendable graphs

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