Ear decompositions in combed graphs
Summary: We introduce the concept of combed graphs and present an ear decomposition theorem for this class of graphs. This theorem includes the well known ear decomposition theorem for matching covered graphs proved by \textit{L. Lovász} and \textit{M.D. Plummer} [Matching theory, Ann. Discrete Math. 29, North-Holland Mathematics Studies 121, Amsterdam, etc. (1986; Zbl 0618.05001)]. Then we use the ear decomposition theorem to show that any two edges of a 2-connected combed graph lie in a balanced circuit of an equivalent combed graph. This result generalises the theorem that any two edges in a matching covered graph with at least four vertices belong to an alternating circuit.
- Ear decompositions of matching covered graphs
- The two ear theorem on matching-covered graphs
- Ear decomposition with bounds on ear length
- Optimal ear decompositions of matching covered graphs and bases for the matching lattice
- On a matroid defined by ear-decompositions of graphs
- Conservative weightings and ear-decompositions of graphs
- Ear decomposition and induced even cycles
- Ear decompositions of join covered graphs
- scientific article; zbMATH DE number 7150552 (Why is no real title available?)
This page was built for publication: Ear decompositions in combed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010725)
