Author:
Korte Bernhard,Vygen Jens
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Aoshima, K., Iri, M.: Comments on F. Hadlock's paper: finding a maximum cut of a planar graph in polynomial time. SIAM Journal on Computing
Aoshima, K.
Iri, M.
Hadlock, F.
6, 86–87 (1977)
2. Camion, P.: Chemins et circuits hamiltoniens des graphes complets. Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences (Paris)
Camion, P.
249, 2151–2152 (1959)
3. Camion, P.: Modulaires unimodulaires. Journal of Combinatorial Theory A
Camion, P.
4, 301–362 (1968)
4. Dirac, G.A.: Some theorems on abstract graphs. Proceedings of the London Mathematical Society
Dirac, G.A.
2, 69–81 (1952)
5. Annals of Discrete Mathematics;J. Edmonds,1977