Meike Tewes und Ingo Schiermeyer - Info zur Person

(1 - 12 von 12

)

Durham Research Online - Durham UniversityDurham University

dro.dur.ac.uk

von T Klimošová · · Zitiert von: 24 — Bert Randerath, Ingo Schiermeyer, and Meike Tewes. Three-colourability and forbidden subgraphs. II: polynomial algorithms. von T Klimošová · · Zitiert von: 24 — Graphs and Combinatorics, 20(1):1–40, Bert Randerath, Ingo Schiermeyer, and Meike Tewes. Three-colourability and forbidden.

(2)-pancyclic graphsScienceGate

www.sciencegate.app

s (05) ◽ ◽. Vol 3 ◽. pp Author(s):. Bert Randerath ◽. Lutz Volkmann ◽. Ingo Schiermeyer ◽. Meike Tewes.

Independent Feedback Vertex Set for P5-free Graphs - DROPSdagstuhl.de

drops.dagstuhl.de

von M Bonamy · · Zitiert von: 36 — Bert Randerath, Ingo Schiermeyer, and Meike Tewes. Three-colourability and forbidden subgraphs. II: polynomial algorithms.

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,.

Wen-Lian Hsu Der-Tsai Lee Chung-Shou LiaoDigitale Bibliothek Thüringen

www.db-thueringen.de

von WL Hsu · — Bert Randerath, Ingo Schiermeyer, and Meike Tewes. Three-colourability and forbidden subgraphs. II: polynomial algorithms.

Lehr- und Forschungsgebiet Diskrete Optimierung

math2.rwth-aachen.de

Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann Discrete Appl. Math (2002), no. 1-3, Almost all almost regular c-partite tournaments with c>=5 are vertex pancyclic

Three-colourability and forbidden subgraphs. II: polynomial ...Uni Trier

dblp.uni-trier.de

— Bert Randerath, Ingo Schiermeyer, Meike Tewes: Three-colourability and forbidden subgraphs. II: polynomial algorithms. Discret. Math.

Longest Paths and Longest Cycles in Graphs with Large Degree Sums |...

link.springer.com

Longest Paths and Longest Cycles in Graphs with Large Degree Sums. Authors; Authors and affiliations. Ingo Schiermeyer; Meike Tewes. Ingo Schiermeyer. 1.

Панциклический граф — Википедия (с комментариями)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

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, ...

Alle Infos zum Namen "Meike Tewes"

Verwandte Suchanfragen zu Meike Tewes

Lutz Volkmann
Martina Westhues
Bert Randerath

Ingo Schiermeyer
Gudrun Smolinski
Judith Keijsper

Cindy Schneider
Marco Schiffner
Michael Randerath

Person "Tewes" (8)
Vorname "Meike" (7991)
Name "Tewes" (744)

sortiert nach Relevanz / Datum

Erweiterte Suche

Person-Suchen: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Meike Tewes und Ingo Schiermeyer Person-Info