Removable edges in Halin graphs

DOI10.1016/j.dam.2024.01.030OpenAlexW4391731252MaRDI QIDQ6130202

No author found.

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 graphremovable edgematching covered graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Matching covered graphs with three removable classes
• A lower bound on the number of removable ears of 1-extendable graphs
• Ear-decompositions of matching-covered graphs
• Matching theory
• Ear decompositions of matching covered graphs
• A generalization of Little's theorem on Pfaffian orientations

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