Even cycles and perfect matchings in claw-free plane graphs

DOI10.23638/DMTCS-22-4-6zbMath1455.05035arXiv2001.10674OpenAlexW3092916102MaRDI QIDQ3386627

Xiumei Wang, Jinjiang Yuan, Shanshan Zhang

Publication date: 5 January 2021

Full work available at URL: https://arxiv.org/abs/2001.10674

zbMATH Keywords

claw-free graphplane graphnice cyclecycle-nice graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

On cycle-nice claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of cycle-forced bipartite graphs
• Ear decomposition of factor-critical graphs and number of maximum matchings
• Ear-decompositions of matching-covered graphs
• Matching theory
• Ear decompositions of matching covered graphs
• Forcing faces in plane bipartite graphs. II
• Pólya's permanent problem
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• Permanents, Pfaffian orientations, and even directed circuits
• Ear decomposition and induced even cycles
• Forcing faces in plane bipartite graphs
• An O ( VE ) algorithm for ear decompositions of matching-covered graphs
• Graphs with 1-Factors
• 1-Factors and Antifactor Sets
• On the number of dissimilar pfaffian orientations of graphs

This page was built for publication: Even cycles and perfect matchings in claw-free plane graphs