A lower bound on the number of removable ears of 1-extendable graphs

DOI10.1016/j.disc.2009.10.024zbMath1195.05063OpenAlexW2064437555MaRDI QIDQ966053

Xiaofeng Guo, Cláudio Leonardo Lucchesi, Shao-hui Zhai

Publication date: 27 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.024

zbMATH Keywords

excessive indexremovable ear1-extendable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Removable edges in Halin graphs

Cites Work

• Matching theory
• Matching structure and the matching lattice
• Ear decompositions of matching covered graphs
• On n-extendable graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound on the number of removable ears of 1-extendable graphs