Matthias Kriesell - Veröffentlichungen allgemein

(1 - 13 von 13

)

The k-Critical 2k-Connected Graphs for k # [3, 4]CORE

core.ac.uk

von M Kriesell · · Zitiert von: 8 — Matthias Kriesell. Institut fur Mathematik (A), Universitat Hannover, Welfengarten 1,. D Hannover, Germany. Received June 1, › download › pdf

Contractible Non-Edges in Triangle-Free Graphs | SpringerLinkspringer.com

link.springer.com

von M Kriesell · · Zitiert von: 8 — Contractible Non-Edges in Triangle-Free Graphs. Matthias Kriesell. Graphs and Combinatorics volume 15, pages 429–439 (1999)Cite this article. 42 Accesses. › article

More on foxes : Matthias Kriesell : Free Download, Borrow, and ...Internet Archive

archive.org

› arxiv-1610

Matthias KriesellThèses.fr

theses.fr

› ...

antidirected - Wiktionary

en.wiktionary.org

English[edit]. Etymology[edit]. anti- + directed. Adjective[edit]. antidirected (not comparable). (mathematics) Such that the canonical mapping is injective. (graph theory) Having arcs that alternate between forward and backward arcs. quotations ▽ , Jorgen Bang-Jensen, Stephane Bessy, Bill Jackson, Matthias Kriesell, ...

Mathematics Jobs Wiki NotableMathWiki

notable.math.ucdavis.edu

TU Ilmenau, discrete, algebra (W3), Jan 14, 2011, Matthias Kriesell [56]. U Jena, math phys (W3), Apr 15, 2011, Dorothea Bahns [57] [58] □.

Contractible Non-Edges in Triangle-Free Graphs | SpringerLink

link.springer.com

Thomassen has proved that every triangle-free k-connected graph contains a pair of adjacent vertices whose identification yields again a k-connected graph

Unique colorability and clique minors : Matthias Kriesell : Free...

archive.org

For a graph G, let h(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected nonempty subgraphs, and let s(G) denote the...

theses.fr – Olivier Durand de Gevigney , Orientations des graphes :...

www.theses.fr

Orienter un graphe c'est remplacer chaque arête par un arc de mêmes extrémités. On s'intéresse à la connexité du graphe orienté ainsi obtenu. L'orientation...

Global Connectivity And Expansion: Long Cycles and Factors In...

link.springer.com

MATTHIAS KRIESELL. Received July 3, Revised April 1, Given a function f : N→R, call an n-vertex graph f-connected if separating off k vertices.

The Personal Publication Reader | SpringerLink

link.springer.com

This application demonstrates how to provide personalized, syndicated views on distributed web data using Semantic Web technologies. The application comprises...

On the problem of finding disjoint cycles and dicycles in a digraph |...

link.springer.com

(1); Matthias Kriesell · .dk (1). Author Affiliations. 1. IMADA, University of Southern Denmark, DK-5230, Odense M, Denmark ...

Verwandte Suchanfragen zu Matthias Kriesell

Nicola Henze
Wolfgang Nejdl
Marc Herrlich

Thomas Böhme
Robert Baumgartner
Christian Enzi

Marcus Herzog
Dieter Kratsch
Stavros Kolliopoulos

Personen
Vorname "Matthias" (50826)
Name "Kriesell" (8)

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

Veröffentlichungen allgemein Matthias Kriesell