Removable and forced subgraphs of graphs

DOI10.1016/J.DAM.2024.03.004MaRDI QIDQ6495257

Heping Zhang, Wuxian Chen

Publication date: 30 April 2024

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

zbMATH Keywords

\(k\)-extendable graphperfect matchingPetersen graphnice cycleforced subgraphremovable subgraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of cycle-forced bipartite graphs
• Matching theory
• On n-extendable graphs
• Extending matchings in graphs: A survey
• On some structural properties of fullerene graphs
• Pólya's permanent problem
• PM-compact graphs and vertex-deleted subgraphs
• On cycle-nice claw-free graphs
• Ear decomposition and induced even cycles
• Even cycles and perfect matchings in claw-free plane graphs
• Onk-Resonant Fullerene Graphs
• Recent Progress in Matching Extension
• Graph Factors and Matching Extensions
• A note onn-extendable graphs
• Randomly matchable graphs
• The isolated-pentagon rule and nice substructures in fullerenes
• On the number of dissimilar pfaffian orientations of graphs
• Removal of subgraphs and perfect matchings in graphs on surfaces

This page was built for publication: Removable and forced subgraphs of graphs