Abstract
This paper can be considered as a continuation of a paper [7] of the author. We consider optimal ear-decompositions of graphs that contain even ears as few as possible. The ear matroid of a graph was introduced in [7] via optimal ear-decompositions. Here we give a simple description of the blocks of the ear matroid of a graph. The second goal of this paper is to point out how the structural result in [7] implies easily the Tight Cut Lemma of Edmonds, Lovász and Pulleyblank. Moreover, we propose the investigation of a new class of graphs that generalizes matching-covered graphs. A graph is called ϕ-covered if each edge may lie on an even ear of an optimal ear-decomposition. Several theorems on matching-covered graphs will be generalized for ϕ-covered graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Cheriyan, A. Sebő, Z. Szigeti, An improved approximation algorithm for the minimum 2-edge-connected spanning subgraph problem, Proceedings of IPCO6, eds.: R.E. Bixby, E.A. Boyd, R.Z. Rios-Mercado, (1998) 126–136.
J. Edmonds, L. Lovász, W. R. Pulleyblank, Brick decompositions and the matching rank of graphs, Combinatorica 2 (1982) 247–274.
A. Frank, Conservative weightings and ear-decompositions of graphs, Combinatorica 13(1)(1993) 65–81.
C.H.C. Little, A theorem on connected graphs in which every edge belongs to a 1-factor, J. Austral. Math. Soc. 18 (1974) 450–452.
L. Lovász, A note on factor-critical graphs, Studia Sci. Math. Hungar. 7 (1972) 279–280.
L. Lovász, M. D. Plummer, “Matching Theory,” North Holland, Amsterdam, (1986).
Z. Szigeti, On Lovász’s Cathedral Theorem, Proceedings of IPCO3, eds.: G. Rinaldi, L.A. Wolsey, (1993) 413–423.
Z. Szigeti, On a matroid defined by ear-decompositions of graphs, Combinatorica 16(2) (1996) 233–241.
Z. Szigeti, On the two ear theorem of matching-covered graphs, Journal of Combinatorial Theory, Series B 74 (1998) 104–109.
Z. Szigeti, Perfect matchings versus odd cuts, Technical Report No. 98865 of Research Institute for Discrete Mathematics, Bonn, 1998.
Z. Szigeti, On generalizations of matching-covered graphs, Technical Report of Research Institute for Discrete Mathematics, Bonn, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szigeti, Z. (1999). On Optimal Ear-Decompositions of Graphs. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1999. Lecture Notes in Computer Science, vol 1610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48777-8_31
Download citation
DOI: https://doi.org/10.1007/3-540-48777-8_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66019-4
Online ISBN: 978-3-540-48777-7
eBook Packages: Springer Book Archive