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

DOI10.1016/J.DISC.2009.10.024zbMATH Open1195.05063OpenAlexW2064437555MaRDI QIDQ966053FDOQ966053

Authors: Xiaofeng Guo, Shaohui Zhai, Cláudio L. Lucchesi 

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

Recommendations

• Removable ears of 1-extendable graphs
• Matching covered graphs with three removable classes
• scientific article; zbMATH DE number 637274
• On almost 1-extendable graphs
• Ear decompositions of matching covered graphs

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)

Cites Work

• Matching theory
• Ear decompositions of matching covered graphs
• On n-extendable graphs
• Matching structure and the matching lattice
• Title not available (Why is that?)
• Some results of minimum sets of 1-factors covering a graph

Cited In (3)

• Removable ears of 1-extendable graphs
• Removable edges in near-bipartite bricks
• Removable edges in Halin graphs

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

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