Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,293,702 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Connected component (graph theory)
Graph (discrete mathematics)
Graph theory
Hall's marriage theorem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing
Igor Malinovic
2019
Corpus ID: 85442172
Knapsack problems give a simple framework for decision making. A classical example is the min-knapsack problem (MINKNAP): choose…
Expand
2015
2015
Tutte's Theorem
D. Spielman
2015
Corpus ID: 126140947
2013
2013
Proportionate growth in patterns formed in the rotor-router model
Rahul Dandekar
,
D. Dhar
2013
Corpus ID: 119296130
We study the growing patterns formed in the rotor-router model by adding N walkers at the centre of an L × L two-dimensional…
Expand
2009
2009
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
J. Harant
,
S. Mengel
Discrete Mathematics
2009
Corpus ID: 46488078
Review
2008
Review
2008
Invited Talks Symmetry , Hadwiger number , pointwise limit of graphs
L. Babai
,
D. West
2008
Corpus ID: 2483385
A vertex k-coloring of a graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map…
Expand
2000
2000
On min-max theorems in matching theory
Z. Szigeti
Electron. Notes Discret. Math.
2000
Corpus ID: 11431544
1997
1997
The ß-assignment problem in general graphs
G. Chang
,
Pei-Hsin Ho
Computers & Operations Research
1997
Corpus ID: 18081576
1994
1994
Convex representations of maps on the torus and other flat surfaces
B. Mohar
Discrete & Computational Geometry
1994
Corpus ID: 30013242
It is shown that every map on the torus satisfying the obvious necessary conditions has a convex representation on the flat…
Expand
1990
1990
Paths and cycles concerning independent edges
A. Kaneko
Graphs Comb.
1990
Corpus ID: 7122623
R. Häggkvist and C. Thomassen defined admissible paths in [5] which is a generalization of alternating paths. A path or a cycleD…
Expand
1989
1989
Odd Path Packings
W. Pulleyblank
,
D. Werra
European journal of combinatorics (Print)
1989
Corpus ID: 41120980
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE