Conferences in DBLP
W. T. Tuttle Polynomials. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:1-8 [Conf ] James G. Oxley , Geoff Whittle Tuttle invariants for 2-polymatroids. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:9-20 [Conf ] Joseph P. S. Kung Extremmal matroid theory. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:21-62 [Conf ] Teresa M. Przytycka , Józef H. Przytycki Subexponentially computable truncations of Jones-types polynomials. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:63-108 [Conf ] Dominic Welsh Knots and braids: Some algorithmic questions. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:109-124 [Conf ] Neil Robertson , Paul D. Seymour , Robin Thomas A survey of linkless embeddings. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:125-136 [Conf ] Yves Colin de Verdière On a new graph invariant and a criterion for planarity. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:137-148 [Conf ] Oleg V. Borodin Four problems on plane graphs raised by Branko Grünbaum. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:149-156 [Conf ] Bruce A. Reed Counterexamples to a conjecture of Las Vergnas and Meyniel. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:157-160 [Conf ] Béla Bollobás , Bruce A. Reed , Andrew Thomason An extremal function for the achromatic number. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:161-166 [Conf ] Hans Jürgen Prömel , Angelika Steger The asymptotic structure of H-free graphs. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:167-178 [Conf ] Michael R. Fellows , Jan Kratochvíl , Matthias Middendorf , Frank Pfeiffer Induced minors and related problems. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:179-182 [Conf ] Alexander Schrijver Induced circuits in graphs on surfaces. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:183-194 [Conf ] András Frank , Tibor Jordán Tree-representation of directed circuits. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:195-202 [Conf ] William McCuaig Intercyclic digraphs. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:203-246 [Conf ] Jørgen Bang-Jensen , Svatopluk Poljak Eulerian trails through a set of terminals in specific, unique and all orders. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:247-258 [Conf ] Haruko Okamura 2-reducible cycles containing two specified edges in (2k+1)-edge-connected graphs. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:259-278 [Conf ] Andreas Huck Edge-disjoint cycles in n-edge-connected graphs. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:279-294 [Conf ] Bruce A. Reed , Neil Robertson , Alexander Schrijver , Paul D. Seymour Finding dsjoint trees in planar graphs in linear time. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:295-302 [Conf ] Teresa M. Przytycka , Józef H. Przytycki Surface triangulations without short noncontractible cycles. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:303-340 [Conf ] Richard P. Vitray Representativity and flexibility on the projective plane. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:341-348 [Conf ] Xiaoya Zha , Yue Zhao On non-null separating circuits in embedded graphs. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:349-362 [Conf ] Seiya Negami Projective-planar graphs with even duals II. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:363-380 [Conf ] Nathaniel Dean , Katsuhiro Ota 2-factors, connectivity, and graph minors. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:381-386 [Conf ] John Philip Huneke A conjecture in topological graph theory. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:387-390 [Conf ] Xiaoya Zha On the closed 2-cell embedding conjecture. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:391-404 [Conf ] Cun-Quan Zhang Cycle cover theorems and their applications. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:405-418 [Conf ] Luis A. Goddyn Cones, lattices and Hilbert bases of circuits and perfect matchings. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:419-440 [Conf ] Pavol Gvozdjak , Jozef Sirán Regular maps from voltage assignments. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:441-454 [Conf ] Bogdan Oporowski The infinite grid covers the infinite half-grid. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:455-460 [Conf ] Reinhard Diestel Dominating functions and topological graph minors. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:461-476 [Conf ] Heinz Adolf Jung Notes on rays and automorphisms of locally finite graphs. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:477-484 [Conf ] Lew Gordeev Quasi-ordinals and proof theory. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:485-494 [Conf ] Dirk Vertigan Minor classes (extended abstract). [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:495-510 [Conf ] Jens Gustedt Well-quasi-ordering finite posets. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:511-516 [Conf ] Guoli Ding The immersion relation on webs. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:517-524 [Conf ] Neil Robertson , Paul D. Seymour , Robin Thomas Structural descriptions of lower ideals of trees. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:525-538 [Conf ] Karl R. Abrahamson , Michael R. Fellows Finite automata, bounded treewidth, and well-quasiordering. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:539-564 [Conf ] Bruno Courcelle Graph grammars, monadic second-order logic and the theory of graph minors. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:565-590 [Conf ] Andrzej Proskurowski Graph reductions, and techniques for finding minimal forbidden minors. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:591-600 [Conf ] Jens Lagergren An upper bound on the size of an obstruction. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:601-622 [Conf ] Michael A. Langston An obstruction-based approach to layout optimization. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:623-630 [Conf ] Collette R. Coullard , Donald K. Wagner Decomposing 3-connected graphs. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:631-634 [Conf ] Alexander K. Kelmans Graph planarity and related topics. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:635-668 [Conf ] Neil Robertson , Paul D. Seymour Excluding a graph with one crossing. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:669-676 [Conf ] Nathaniel Dean Open problems. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:677-0 [Conf ]