1
0
0
(1 - 16 von 17
)
Lutz Volkmann - The Mathematics Genealogy Project
www.genealogy.math.ndsu.nodak.edu
Meike Tewes: Rheinisch-Westfälische Technische Hochschule Aachen: 1999: Stefan Winzen: Rheinisch-Westfälische Technische Hochschule Aachen: 2004
RNDr. Tomáš Masařík Variants of graph labeling problemskrakonos.org
tarken.krakonos.org
von RNDT Masařík — [132] Bert Randerath, Ingo Schiermeyer, and Meike Tewes. Three-colourability and forbidden subgraphs. II: polynomial algorithms. Discrete Mathematics,.
RWTH Aachen University — Chair for Mathematics of Information...
www.mathc.rwth-aachen.de
Publications • Yubao Guo, Lutz ... Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo. Sufficient conditions for semicomplete multipartite digraphs to be hamiltonian.
dblp: Discrete Applied Mathematics, Volume 120
dblp.uni-trier.de
Bibliographic content of Discrete Applied Mathematics, Volume 120
Springer Monographs in Mathematicslagout.org
doc.lagout.org
— Schrijver, Paul Seymour, Eng Guan Tay, Meike Tewes, Stéphan Thomassé,. Carsten Thomassen, Bjarne Toft, Lutz Volkmann, Anders Yeo and Ke-Min.
dblp: Discrete Mathematics, Volume 231
dblp.uni-trier.de
Bibliographic content of Discrete Mathematics, Volume 231
Панциклический граф — Википедия (с комментариями)wiki-org.ru
wiki-org.ru
— Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann Vertex pancyclic graphs // Discrete Applied Mathematics. — — Т. 120, вып.
Wikipedia: Graphe pancyclique - Wikipédia
Bert Randerath, Ingo Schiermeyer, Meike Tewes et Lutz Volkmann, « Vertex pancyclic graphs », Discrete Applied Mathematics, vol. 120, nos 1-3, , p. › wiki › Gr...
Wikipedia: Панциклічний графWikipedia
Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann. Vertex pancyclic graphs // Discrete Applied Mathematics. — — Т. 120, вип. › wiki
Meike Tewes - The Mathematics Genealogy ProjectThe Mathematics Genealogy Project
www.mathgenealogy.org
Meike Tewes. MathSciNet. Dr. rer. nat. Rheinisch-Westfälische Technische Hochschule Aachen Germany. Dissertation ...
DMGTDiscussiones Mathematicae Graph Theory
www.dmgt.uz.zgora.pl
Meike Tewes. Freiberg University Faculty of Mathematics and Computer Sciences Freiberg, Germany. Abstract. A β-perfect graph is a simple graph G such ...
Discrete Mathematics 2000, volume: 222, number: 1-3Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης
sceas.csd.auth.gr
Gregory Gutin, Meike Tewes, Anders Yeo Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs.
Table of Contents for Discrete MathematicsQueen Mary University of London
webspace.maths.qmul.ac.uk
BBC17 ; Meike Tewes and Lutz Volkmann: The ratio of the longest cycle and longest path in semicomplete multipartite digraphs ; Kazuhiko Ushio and ...
The 3-Colorability Problem on Graphs with Maximum ...Society for Industrial and Applied Mathematics
epubs.siam.org
von M Kochol · · Zitiert von: 33 — Bert Randerath, Ingo Schiermeyer, Meike Tewes, Three‐colourability and forbidden subgraphs. II. Polynomial algorithms, Discrete Math., 251 (2002), 137–153, ...
SCEAS
sceas.csd.auth.gr
Discrete Mathematics, 2001, v:231, n:1-3, pp: [Journal]; Meike Tewes, Lutz Volkmann The ratio of the longest cycle and longest path in semicomplete ...
Table of Contents for Discrete Mathematics
webspace.maths.qmul.ac.uk
Meike Tewes, Lutz Volkmann, Vertex deletion and cycles in multipartite tournaments, Discrete Mathematics ( )1-3 (1999) pp H. Trommel, H.J. Veldman, A
Alle Infos zum Namen "Meike Tewes"
sortiert nach Relevanz / Datum