Removable edges in Halin graphs

DOI10.1016/J.DAM.2024.01.030MaRDI QIDQ6130202zbMATH OpenOpenAlexFDO

Authors

Publication date 2 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.01.030

zbMATH Keywords

Halin graphmatching covered graphremovable edge

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Removable Edges in Claw-Free Bricks
• Removable edges in near-bipartite bricks
• Matching covered graphs with three removable classes
• A note on removable edges in near-bricks

Cites work

• A generalization of Little's theorem on Pfaffian orientations
• A lower bound on the number of removable ears of 1-extendable graphs
• Ear decompositions of matching covered graphs
• Ear-decompositions of matching-covered graphs
• Graph theory
• scientific article; zbMATH DE number 3853133 (Why is no real title available?)
• Matching covered graphs with three removable classes
• Matching theory

Cited in

(1)

• Removable and forced subgraphs of graphs

This page was built for publication: Removable edges in Halin graphs

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