no. 3
From L. Euler to D. König
RAIRO. Operations Research, Tome 43 (2009) no. 3, pp. 247-251

Starting from the famous Königsberg bridge problem which Euler described in 1736, we intend to show that some results obtained 180 years later by König are very close to Euler's discoveries.

DOI : 10.1051/ro/2009020
Classification : 05C15
Keywords: eulerian graph, edge coloring, parity, König theorem 
@article{RO_2009__43_3_247_0,
     author = {Werra, Dominique de},
     title = {From {L.} {Euler} to {D.} {K\"onig}},
     journal = {RAIRO. Operations Research},
     pages = {247--251},
     year = {2009},
     publisher = {EDP-Sciences},
     volume = {43},
     number = {3},
     doi = {10.1051/ro/2009020},
     mrnumber = {2567987},
     zbl = {1175.05003},
     language = {en},
     url = {https://www.numdam.org/articles/10.1051/ro/2009020/}
}
TY  - JOUR
AU  - Werra, Dominique de
TI  - From L. Euler to D. König
JO  - RAIRO. Operations Research
PY  - 2009
SP  - 247
EP  - 251
VL  - 43
IS  - 3
PB  - EDP-Sciences
UR  - https://www.numdam.org/articles/10.1051/ro/2009020/
DO  - 10.1051/ro/2009020
LA  - en
ID  - RO_2009__43_3_247_0
ER  - 
%0 Journal Article
%A Werra, Dominique de
%T From L. Euler to D. König
%J RAIRO. Operations Research
%D 2009
%P 247-251
%V 43
%N 3
%I EDP-Sciences
%U https://www.numdam.org/articles/10.1051/ro/2009020/
%R 10.1051/ro/2009020
%G en
%F RO_2009__43_3_247_0
Werra, Dominique de. From L. Euler to D. König. RAIRO. Operations Research, Tome 43 (2009) no. 3, pp. 247-251. doi: 10.1051/ro/2009020

[1] C. Berge, Graphes. Gauthier-Villars, Paris (1983). | Zbl | MR

[2] D. De Werra, Equitable colorations of graphs. Revue Française d'Informatique et de Recherche Opérationnelle R-3 (1971) 3-8. | Zbl | MR | Numdam

[3] L. Euler, Solutio problematis ad geometriam situs pertinentis, Commentarii Academiae Scientiarum Imperialis Petropolitanae 8 (1736) 128-140. Reprinted in: Leonhardi Euleri - Opera Omnia - Series Prima - Opera Mathematica - Commentationes Algebraicae, L.G. du Pasquier Ed., Teubner, Leipzig (1923) 1-10.

[4] H.N. Gabow, Using Euler partitions to edge color bipartite multigraphs. Int. J. Parallel Prog. 5 (1976) 345-355. | Zbl | MR

[5] I. Gribkovskai, Ø. Halskan and G. Laporte, The bridges of Königsberg - a historical perspective. Networks 49 (2007) 199-203. | Zbl | MR

[6] C. Hierholzer, Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Math. Ann. 6 (1873) 30-32. | MR | JFM

[7] D. König, Graphok és alkalmazásuk a determinánsok és a halmazok elméletére (Hungarian). Mathematikai és Természettudományi Értesitö 34 (1916) 104-119. | JFM

[8] A. Schrijver, Bipartite edge coloring in 0(δm)time. SIAM J. Comput. 28 (1998) 841-846. | Zbl | MR

Cité par Sources :