Removable and forced subgraphs of graphs

DOI10.1016/J.DAM.2024.03.004MaRDI QIDQ6495257zbMATH OpenFDO

Authors Wuxian Chen, Heping Zhang

Publication date 30 April 2024

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

Full work available at URL https://doi.org/10.1016/J.DAM.2024.03.004

zbMATH Keywords

\(k\)-extendable graphforced subgraphnice cycleperfect matchingPetersen graphremovable subgraph

Mathematics Subject Classification ID

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

Recommendations

• Matching covered graphs with three removable classes
• On removable cycles in connected graphs.
• Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3
• Removable edges in Halin graphs
• Bicritical graphs without removable edges

Cites work

• A characterization of cycle-forced bipartite graphs
• A note onn-extendable graphs
• Conjugated circuits and forcing edges
• Ear decomposition and induced even cycles
• Even cycles and perfect matchings in claw-free plane graphs
• Extending matchings in graphs: A survey
• Forcing hexagons in hexagonal systems
• Graph Factors and Matching Extensions
• scientific article; zbMATH DE number 1161241 (Why is no real title available?)
• scientific article; zbMATH DE number 1559555 (Why is no real title available?)
• Matching theory
• Maximum forcing number of hexagonal systems
• On k-resonant fullerene graphs
• On cycle-nice claw-free graphs
• On n-extendable graphs
• On some structural properties of fullerene graphs
• On the number of dissimilar pfaffian orientations of graphs
• PM-compact graphs and vertex-deleted subgraphs
• Pólya's permanent problem
• Randomly matchable graphs
• Recent Progress in Matching Extension
• Removal of subgraphs and perfect matchings in graphs on surfaces
• The isolated-pentagon rule and nice substructures in fullerenes

Cited in

(1)

• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey

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

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