See this document in CiteSeerX!

DIMATIA DIMACS Research Experience for Undergraduates (1999)  (Make Corrections)  
Study texts for July 15. - August 5. 1999 Prague Supported by NSF - AV CR...



  Home/Search   Context   Related

 
View or download:
webcache.ms.mff.cu...MSer.99422.ps.gz
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  webcache.ms.mff.cuni.cz/...kamser (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Nowhere-Zero Flows Problems, Coloring problems, Cycle cover problems lie in the core of graph theory. The strong relationship between them is the duality. Several important (and beautiful) conjectures are still open and this a very active field of study. We presente this subject with the enlightening notion of duality. 1 Introduction This paper was written for the traditional Spring School of the Combinatorial Seminar at Charles University which was held in April 1999 in Borov'a Lada and in... (Update)

Similar documents (at the sentence level):
7.5%:   Antisymmetric Flows and Strong Colourings of Oriented Graphs - Nesetril, Raspaud (1998)   (Correct)

Active bibliography (related documents):   More   All
1.5:   Cones, Lattices and Hilbert Bases of Circuits and Perfect Matchings - Goddyn (1991)   (Correct)
1.1:   On Flow and Tension-Continuous Maps - DeVos, Nesetril, Raspaud (2002)   (Correct)
0.5:   Research Statement - Kündgen   (Correct)

Similar documents based on text:   More   All
0.8:   Study Texts for - Dimatia Dimacs Research (1999)   (Correct)
0.4:   On Four Coloring Problems - Nesetril, Sopena (1999)   (Correct)
0.2:   Dimatia 1997-1999 - Nesetril, Kratochvíl, Janota (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ prague-dimatia,
  author = "July August Prague",
  title = "DIMATIA - DIMACS Research Experience for Undergraduates",
  url = "citeseer.ist.psu.edu/413347.html" }
Citations (may not include all citations):
158   Matroid Theory (context) - Welsh - 1976
151   Every planar map is four colorable (context) - Appel, Haken - 1976
126   Combinatorial problems and exercises (context) - Lov'asz - 1993
85   Wiley-Interscience Series in Discrete Mathematics (context) - Schrijver, linear et al. - 1986
51   London Math (context) - On, of et al. - 1949
42   Edge-disjoint spanning trees of finite graphs (context) - St, Nash-Williams - 1961
40   A contribution to the theory of chromatic polynomials (context) - Tutte - 1954
36   and hyperbolic geometry (context) - Sleator, Tarjan et al. - 1988
36   the problem of decomposing a graph into n connected factors (context) - Tutte - 1961
23   Graduate Texts in Mathematics (context) - Bollob'as, Theory - 1998
19   Nowhere-zero flows (context) - Seymour - 1995
19   Nowhere-zero 6-flows (context) - Seymour - 1981
18   Colorings and girth of oriented planar graphs - Nesetril, Raspaud et al. - 1997
15   Graphs with the circuit cover property (context) - Alspach, Goddyn et al. - 1994
15   Geometric algorithms and combinatorial optimization (context) - Groetschel, Lovasz et al. - 1993
12   A Survey of cycle double cover conjecture (context) - Jaeger - 1985
12   A new proof of the four-colour theorem - Robertson, Sanders et al. - 1996
12   Flows and Generalized Coloring Theorems in Graphs (context) - Jaeger - 1979
11   Bounds on the number of disjoint spanning trees (context) - Kundu - 1974
10   Invitation to Discrete Mathematics (context) - Matousek, Nesetril - 1998
9   Remarks on colouring of maps (context) - Tait
8   Map Coloring and the Vector Cross Product (context) - Kauffman - 1990
8   An update on the four-color theorem - Thomas - 1998
7   Formal knot theory (context) - Kauffman - 1983
7   Selected topics in Graph Theory (context) - Jaeger, Problems - 1988
6   and the lonely runner (context) - Bienia, Goddyn et al. - 1998
5   Ramsey Theory (context) - Nesetril - 1995
4   Shortest Covering of Graphs with Cycles (context) - Bermond, Jackson et al. - 1983
3   line coloring and recursive graph theory (context) - Kierstead, Penrice et al. - 1994
3   A class of Abelian groups (context) - Tutte - 1956
3   Tutte's edge-colouring conjecture (context) - Robertson, Seymour et al. - 1997
3   Covering Multigraphs by Simple Circuits (context) - Alon, Tarsi - 1985
2   Rotation distance using flows (context) - Kenyon, Thurston - 1994
2   Sur les colorations des aretes des graphes cubiques (context) - Preissmann - 1981
2   Integer Flows and Cycle Covers (context) - Fan - 1992
2   The Jordan-Schoenflies theorem and the classification of sur.. (context) - Thomassen - 1992
2   Antisymmetric Flows and Strong Colourings of Oriented Graphs - Nesetril, Raspaud
2   Short Circuit Covers for Regular Matroids with a Nowhere-zer.. (context) - Jamshi, Raspaud et al. - 1987
2   Princeton: Princeton University Press (context) - Weyl - 1952
1   Cycle Covers of Graphs with a Nowhere-zero Flow (context) - Raspaud - 1991
1   Tutte's first colour-cycle conjecture (context) - Kilpatrick - 1975
1   Minimum Cycle Covers of Graphs (context) - Fan - 1997
1   A dual form of Ramsey Theorem (context) - Carlson, Simpson - 1984
1   Proofs of two Minimum Circuit Covers Conjectures (context) - Fan - 1998
1   Kurchatov Institute of Atomic Energy IAE-5537/1 Moscow (context) - The, theorem - 1992
1   New York - San Francisco: W (context) - Chv'atal - 1983
1   Algebraic Mathods of Discrete Mathematics (context) - Kucera, Nesetril - 1988
1   Zur Theorie der diskreten Gebilde (context) - Grotzsch - 1958
1   Signed Diagonal Flips and the Four Color Theorem (context) - Eliahou - 1998
1   Minimum Cycle Coverings and Integer Flows (context) - Zhang - 1990
1   The result was announced in a world premiere at the Fifth-Cz.. (context) - Robertson, Seymour et al. - 1998
1   Lecture Notes in Computer Science (context) - Itai, Rodeh et al. - 1978
1   catalogue and texts (context) - Naceradsk'y, Nesetril - 1999
1   the complexity of minimum cycle covers of graphs (context) - Thomassen
1   the algebraic theory of graph colorings J (context) - Tutte - 1966
1   John Hopkins uUiversity Press (context) - Mohar, Thomassen et al. - 1998
1   Short Cycle Covers and the Cycle Double Conjecture (context) - Jamshy, Tarsi - 1992
1   Private communication (context) - Jaeger
1   Dual Ramsey type theorems (context) - Nesetril, Rodl - 1980
1   Fourt Coloring Problem (context) - Nesetril, Sopena - 1999
1   Short Cycle Covers for Binary Matroids with a Petersen Flow (context) - Raspaud

Documents on the same site (http://webcache.ms.mff.cuni.cz/acad/kam/serie/kamser.html):   More
Combinatorics Of Mappings (Graph Homomorphisms and Their Use) - Nesetril (2000)   (Correct)
A Theory of Pfaffian Orientations I: Perfect Matchings and.. - Galluccio, Loebl (1997)   (Correct)
Midsummer Combinatorial Workshop VI - Prague Ju Ly (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC