A lower bound on the number of removable ears of 1-extendable graphs
From MaRDI portal
Publication:966053
DOI10.1016/j.disc.2009.10.024zbMath1195.05063MaRDI 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
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work