Abstract
A set M of edges of a graph G is a matching of G if each vertex of G is incident with at most one edge of M and a perfect matching of G if each vertex of G is incident with precisely one edge of M.
Supported by CNPq, Brazil. Member of PRONEX 107/97 (mct/finep)
Supported by CNPq, and FAPESP, Brazil. Member of pronex 107/97 (mct/finep)
Partially supported by CNPq and FAPESP during his visit to unicamp, Brazil.
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.
References
C. N. Campos and C. L. Lucchesi. On the characteristic of a separating cut in a matching covered graph. Technical Report 22, Institute of Computing, University of Campinas, Brazil, 2000.
M. H. de Carvalho. Decomposição Ótima em Orelhas para Grafos Matching Covered. PhD thesis, Institute of Computing-University of Campinas, Brazil, 1997. In Portuguese.
M. H. de Carvalho, C. L. Lucchesi, and U. S. R. Murty. Ear decompositions of matching covered graphs. Combinatorica, 19:151–174, 1999.
M. H. de Carvalho, C. L. Lucchesi, and U. S. R. Murty. On a conjecture of Lovász concerning bricks. I. The characteristic of a matching covered graph. Submitted for publication, 1999.
M. H. de Carvalho, C. L. Lucchesi, and U. S. R. Murty. On a conjecture of Lovász concerning bricks. II. Bricks of finite characteristic. Submitted for publication, 1999.
M. H. de Carvalho, C. L. Lucchesi, and U. S. R. Murty. Optimal ear decompositions of matching covered graphs. Submitted for publication, 1999.
J. Edmonds, L. Lovász, and W. R. PulleyblanK.Brick decomposition and the matching rank of graphs. Combinatorica, 2:247–274, 1982.
D. R. Fulkerson. Blocking and antiblocking pairs of polyhedra. Math. Programming, 1:168–194, 1971.
A. M. H. Gerards, L. Lovász, K. Truemper, A. Schrijver, P. Seymour, and S. Shih. Regular matroids from graphs. Under preparation.
P. Hall. On representatives of subsets. J. London Math. Soc, 10:26–30, 1935.
L. Lovász. Ear decompositions of matching covered graphs. Combinatorica, 3:105–117, 1983.
L. Lovász. Matching structure and the matching lattice. J. Combin. Theory (B), 43:187–222, 1987.
L. Lovász and M. D. Plummer. Matching Theory. Number 29 in Annals of Discrete Mathematics. Elsevier Science, 1986.
U. S. R. Murty. The matching lattice and related topics. Technical report, University of Waterloo, 1994. Preliminary Report.
N. Robertson, D. Sanders, P. D. Seymour, and R. Thomas. The four-colour theorem. J. Combin. Theory (B), pages 2–44, 1997.
N. Robertson, P. D. Seymour, and R. Thomas. Excluded minors in cubic graphs. Manuscript.
N. Robertson, P. D. Seymour, and R. Thomas. Tutte’s edge-coloring conjecture. J. Combin. Theory (B), pages 166–183, 1997.
D. Sanders, P. D. Seymour, and R. Thomas. Edge three-coloring cubic doublecross graphs. Manuscript.
D. Sanders and R. Thomas. Edge three-coloring cubic apex graphs. Manuscript.
A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
P. D. Seymour. On multicolourings of cubic graphs and conjectures of Pulkerson and Tutte. Proc. London Math. Soc. Series 3, 38:423–460, 1979.
Z. Szigeti. Perfect matchings versus odd cuts.submitted for publication, November 1998.
P. G. Tait. Note on a theorem in geometry of position. Trans. Roy. Soc. of Edinburgh, pages 657–660, 1880.
W. T. Tutte. The factorizations of linear graphs. J. London Math. Soc, 22:107–111, 1947.
W. T. Tutte. On the algebraic theory of graph colorings. J. Combin. Theory, 1:15–50, 1966.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
de Carvalho, M.H., Lucchesi, C.L., Murty, U.S.R. (2003). The Matching Lattice. In: Reed, B.A., Sales, C.L. (eds) Recent Advances in Algorithms and Combinatorics. CMS Books in Mathematics / Ouvrages de mathématiques de la SMC. Springer, New York, NY. https://doi.org/10.1007/0-387-22444-0_1
Download citation
DOI: https://doi.org/10.1007/0-387-22444-0_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9268-2
Online ISBN: 978-0-387-22444-2
eBook Packages: Springer Book Archive