Searching for authors named "Ingo Schiermeyer" – sorted by Relevance.
-
On the Independence Number of a Graph in Terms of N and M
- For the independence number ff(G) of a connected graph G on n vertices with m edges the inequality ff(G) 1 2 [ (2m + n + 1) \Gamma p (2m + n + 1) 2 \Gamma 4n 2 ] is proved and its algorithmic realization is discussed. Keywords: Independence, Stability 1. Introduction and Theorem Let G =
- Add To MetaCart
-
Vertex Colouring and Forbidden Subgraphs - a Survey
- { a survey Bert Randerath 1 , Ingo Schiermeyer 2 1 Institut fur Informatik, Universitat zu K
- Cited by 3 (0 self) – Add To MetaCart
-
2-Factors and Hamiltonicity
- . O. Box 314 306 14 Plzen Czech Republic Ingo Schiermeyer Lehrstuhl fur Diskrete Mathematik und
- Add To MetaCart
-
Forbidden subgraphs and MIN-algorithm for independence number
- -mail ryjacek@(email omitted); Ingo Schiermeyer Department of Mathematics Technical University of Freiberg D-09596
- Cited by 3 (0 self) – Add To MetaCart
-
Closure Concepts - a Survey
- @(email omitted); Ingo Schiermeyer Department of Mathematics Technical University of Freiberg D-09596 Freiberg Germany e
- Cited by 7 (5 self) – Add To MetaCart
-
Forbidden Subgraphs, Stability and Hamiltonicity
- of Mathematics University of West Bohemia Univerzitn'i 22 306 14 Plzen Czech Republic Ingo Schiermeyer Lehrstuhl
- Cited by 7 (3 self) – Add To MetaCart
-
Local Connectivity and Cycle Extension in Claw-Free Graphs
- University of West Bohemia 30614 Pilsen Czech Republic Ingo Schiermeyer Lehrstuhl C fur Mathematik Technische
- Cited by 1 (1 self) – Add To MetaCart
-
Forbidden Subgraphs And Cycle Extendability
- University of West Bohemia 30614 Pilsen Czech Republic Ingo Schiermeyer 1;2 Lehrstuhl C fur Mathematik
- Cited by 9 (5 self) – Add To MetaCart
-
Claw-Free and Generalized Bull-Free Graphs of Large Diameter Are Hamiltonian
- e-mail ryjacek@(email omitted); Ingo Schiermeyer Lehrstuhl fur Diskrete Mathematik und Grundlagen der
- Cited by 2 (1 self) – Add To MetaCart
-
Pure Literal Look Ahead: An O(1,497^n) Satisfiability Algorithm (Extended Abstract)
- PURE LITERAL LOOK AHEAD: AN O(1; 497 n ) 3-SATISFIABILITY ALGORITHM (extended abstract) Ingo
- Add To MetaCart

