Skip to search formSkip to main contentSkip to account menu

Tutte theorem

Known as: Tutte's theorem 
In the mathematical discipline of graph theory the Tutte theorem, named after William Thomas Tutte, is a characterization of graphs with perfect… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Knapsack problems give a simple framework for decision making. A classical example is the min-knapsack problem (MINKNAP): choose… 
2015
2015
2013
2013
We study the growing patterns formed in the rotor-router model by adding N walkers at the centre of an L × L two-dimensional… 
Review
2008
Review
2008
A vertex k-coloring of a graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map… 
2000
2000
  • Z. Szigeti
  • 2000
  • Corpus ID: 11431544
1994
1994
It is shown that every map on the torus satisfying the obvious necessary conditions has a convex representation on the flat… 
1990
1990
R. Häggkvist and C. Thomassen defined admissible paths in [5] which is a generalization of alternating paths. A path or a cycleD… 
1989
1989