Removable ears of 1-extendable graphs

DOI10.1007/S11424-010-7122-0zbMATH Open1222.05138OpenAlexW1970806913MaRDI QIDQ601904FDOQ601904

Authors: Xiaofeng Guo, Shaohui Zhai 

Publication date: 29 October 2010

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-010-7122-0

Recommendations

• A lower bound on the number of removable ears of 1-extendable graphs
• Ear decompositions of matching covered graphs
• Removable edges in near-bricks
• scientific article; zbMATH DE number 637274
• On almost 1-extendable graphs

zbMATH Keywords

removable edgeremovable ear1-extendable graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Ear-decompositions of matching-covered graphs
• Ear decompositions of matching covered graphs
• On n-extendable graphs
• Title not available (Why is that?)
• Matching structure and the matching lattice
• Brick decompositions and the matching rank of graphs
• Title not available (Why is that?)

Cited In (1)

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

This page was built for publication: 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 Q601904)