On some connectivity properties of Eulerian graphs

  • L. Lovász


Connectivity Property Eulerian Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    T. Gallai, Maximum-Minimumsätze und verallgemeinerte Faktoren von Graphen,Acta Math. Acad. Sci. Hungar. 12 (1961), 131–173.Google Scholar
  2. [2]
    A. Kotzig,Suvilost a pravidelná suvilost konecnych grafov, D. Sc. Thesis, Karlova Universita Praha, VSE (Bratislava, 1956).Google Scholar
  3. [3]
    A. Kotzig, Vertex splittings preserving the maximal edge-connectedness of 4-regular multigraphs,J. Comb. Theory (to appear).Google Scholar
  4. [4]
    B. Rothschild andA. Whinston, Feasibility of two commodity network flows,Operations Research,14 (1966), 1121–1129.Google Scholar
  5. [5]
    G. J. Simmons, Command graphs,Infinite and Finite Sets, Coll. Math. Soc. J. Bolyai10 (Bolyai-North-Holland, 1975), 1277–1349.Google Scholar

Copyright information

© Akadémiai Kiadó 1976

Authors and Affiliations

  • L. Lovász
    • 1
  1. 1.Bolyai InstituteJózsef Attila UniversitySzegedHungary

Personalised recommendations