Skip to main content
SpringerLink
Log in

Hypo-matchings in Directed Graphs

  • Chapter
Graph Theory in Paris

Part of the book series: Trends in Mathematics ((TM))

  • 1265 Accesses

Abstract

We give a common generalization of results on hypo-matchings given in a sequence of papers by G. Cornuéjols, D. Hartvigsen and W. Pulleyblank in [2, 3, 4, 5] and results on even factors given by W.H. Cunningham and J.F. Geelen in [7] and by the author and L. Szegő in [13].

The author is supported by the Egerváry Research Group of the Hungarian Academy of Sciences. Supported by European MCRTN Adonet, Contract Grant No. 504438. Research supported by the Hungarian National Foundation for Scientific Research Grant, OTKA T037547.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, Sur le couplage maximum d’un graph, Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences 247 (1958) 258–259.

    MathSciNet  Google Scholar 

  2. G. Cornuéjols and D. Hartvigsen, An extension of matching theory, Journal of Combinatorial Theory Ser. B 40 (1986) 285–296.

    Article  Google Scholar 

  3. G. Cornuéjols, D. Hartvigsen and W. Pulleyblank, Packing subgraphs in a graph, Op. Res. Letters, (1982) 139–143.

    Google Scholar 

  4. G. Cornuéjols and W. Pulleyblank, A matching problem with side conditions, Discrete Mathematics 29 (1980) 135–159.

    Article  MathSciNet  Google Scholar 

  5. G. Cornuéjols and W. Pulleyblank, Critical graphs, matchings and tours or a hierarchy of the travelling salesman problem, Combinatorica 3(1) (1983) 35–52.

    MathSciNet  Google Scholar 

  6. W.H. Cunningham, Matching, Matroids and Extensions, Math. Program. Ser. B 91 (2002) 3, 515–542.

    Article  MathSciNet  Google Scholar 

  7. W.H. Cunningham and J.F. Geelen, The Optimal Path-Matching Problem, Combinatorica, 17/3 (1997), 315–336.

    Article  MathSciNet  Google Scholar 

  8. W.H. Cunningham and J.F. Geelen, Combinatorial Algorithms for Path-Matching, manuscript, (2000).

    Google Scholar 

  9. J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics 17 (1965) 449–467.

    MathSciNet  Google Scholar 

  10. T. Gallai, Maximale Systeme unabhängiger Kanten, A Magyar Tudományos Akadémia Matematika Kutatóintézetének Közleményei 9 (1964) 401–413.

    MathSciNet  Google Scholar 

  11. A. Frank and L. Szegő, A Note on the Path-Matching Formula, J. of Graph Theory 41/2, (2002) 110–119.

    Article  Google Scholar 

  12. L. Lovász and M.D. Plummer, Matching Theory, Akadémiai Kiadó, Budapest, 1986.

    Google Scholar 

  13. G. Pap and L. Szegő, On the Maximum Even Factor in Weakly Symmetric Graphs, Journal of Combinatorial Theory Ser. B, 91/2 (2004) 201–213.

    Article  Google Scholar 

  14. G. Pap and L. Szegő, On factorizations of directed graphs by cycles, EGRES Technical Report, TR-2004-01.

    Google Scholar 

  15. G. Pap, Alternating paths revisited I: even factors, EGRES Technical Report, TR-2004-18.

    Google Scholar 

  16. M. Loebl and S. Poljak, Efficient Subgraph Packing, Journal of Combinatorial Theory Ser. B, 59 (1993), 106–121.

    Article  MathSciNet  Google Scholar 

  17. W.T. Tutte, The factorization of linear graphs, The Journal of the London Mathematical Society 22, (1947) 107–111.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Operations Research, Eötvös University, Pázmány Péter sétány 1/C, Budapest, Hungary, H-1117

    Gyula Pap

Authors
  1. Gyula Pap
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut Camille Jordan, Université Claude Bernard Lyon 1, 43 boulevard du 11 novembre 1918, 69622, Villeurbanne cedex, France

    Adrian Bondy

  2. Equipe Combinatoire et Optimisation Case 189, Université Pierre et Marie Curie, Paris 6, 75252, Paris Cedex 05, France

    Jean Fonlupt , Jean-Claude Fournier  & Jorge L. Ramírez Alfonsín ,  & 

  3. Laboratoire d’Informatique Fondamentale d’Orléans, Bâtiment IIIA, Rue Léonard de Vinci, B.P. 6759, 45067, Orléans Cedex 2, France

    Jean-Luc Fouquet

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Birkhäuser Verlag Basel/Switzerland

About this chapter

Cite this chapter

Pap, G. (2006). Hypo-matchings in Directed Graphs. In: Bondy, A., Fonlupt, J., Fouquet, JL., Fournier, JC., Ramírez Alfonsín, J.L. (eds) Graph Theory in Paris. Trends in Mathematics. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7400-6_25

Download citation

Publish with us

Policies and ethics

Search

Navigation