OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Goldberg–Seymour conjecture

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Graph coloring
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Goldberg–Seymour conjecture is a statement in the field of graph theory, specifically concerning the behavior of certain types of graphs and their structural properties. Formulated by mathematicians Joshua Goldberg and Paul Seymour in 1988, the conjecture deals with the concepts of graph minors, specifically pertaining to the characterizations of graph classes.

 Ancestors (6)

  1. Graph coloring
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook