Зарегистрироваться
Восстановить пароль
FAQ по входу

Windfeldt T. Computational Aspects of Graph Coloring and the Quillen-Suslin Theorem

  • Файл формата pdf
  • размером 906,76 КБ
Windfeldt T. Computational Aspects of Graph Coloring and the Quillen-Suslin Theorem
Cobenhavn: University of Copenhagen, 2009. - 89 p.
Contents:
Graph Coloring 1
Fibonacci Identities and Graph Colorings
Introduction
Identities
Further Exploration
Algebraic Characterization of Uniquely
Vertex Colorable Graphs
Introduction
Algebraic Preliminaries
Characterization of Vertex Colorability
Characterization of Unique Vertex Colorability
Algorithms for Testing (Unique) Vertex Colorability
Verification of a Counterexample to Xu’s Conjecture
Singular Libraries
The Quillen-Suslin Theorem
Revisiting an Algorithm for the Quillen-Suslin Theorem
Introduction
Algorithm for the Unimodular Row Problem
Complexity
Tricks and Drawbacks
Symmetric Ideals
Minimal Generators for Symmetric Ideals
Introduction
Multisets and monomials
Biibliography
Summary in English
Summary in Danish
Papers to appear
Fibonacci Identities and Graph Colorings
Published papers
Algebraic Characterization of Uniquely Vertex Colorable Graphs
Minimal Generators for Symmetric Ideals
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация