Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity:
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam [u.a.]
North-Holland
1992
|
| Schriftenreihe: | Annals of discrete mathematics
51 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | IX, 400 S. Ill., graph. Darst. |
| ISBN: | 0444895434 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008028751 | ||
| 003 | DE-604 | ||
| 005 | 20150108 | ||
| 007 | t | ||
| 008 | 930713s1992 ad|| |||| 10||| eng d | ||
| 020 | |a 0444895434 |9 0-444-89543-4 | ||
| 035 | |a (OCoLC)25710840 | ||
| 035 | |a (DE-599)BVBBV008028751 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-12 |a DE-11 |a DE-188 |a DE-706 | ||
| 050 | 0 | |a QA164 | |
| 082 | 0 | |a 511/.6 |2 20 | |
| 084 | |a SD 1990 |0 (DE-625)142724: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 050f |2 stub | ||
| 084 | |a DAT 517f |2 stub | ||
| 111 | 2 | |a Czechoslovakian Symposium on Combinatorics, Graphs and Complexity |n 4 |d 1990 |c Prachatice |j Verfasser |0 (DE-588)5060599-9 |4 aut | |
| 245 | 1 | 0 | |a Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity |c ed. by Jaroslav Nešetřil ... |
| 264 | 1 | |a Amsterdam [u.a.] |b North-Holland |c 1992 | |
| 300 | |a IX, 400 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Annals of discrete mathematics |v 51 | |
| 500 | |a Literaturangaben | ||
| 650 | 4 | |a Analyse combinatoire - Congrès | |
| 650 | 7 | |a Analyse combinatoire - Congrès |2 ram | |
| 650 | 4 | |a Complexité de calcul (Informatique) - Congrès | |
| 650 | 7 | |a Complexité de calcul (Informatique) - Congrès |2 ram | |
| 650 | 4 | |a Graphes, Théorie des - Congrès | |
| 650 | 7 | |a Graphes, théorie des - Congrès |2 ram | |
| 650 | 7 | |a analyse combinatoire |2 inriac | |
| 650 | 7 | |a combinatoire |2 inriac | |
| 650 | 7 | |a complexité algorithme |2 inriac | |
| 650 | 7 | |a complexité |2 inriac | |
| 650 | 7 | |a graphe |2 inriac | |
| 650 | 7 | |a mathématiques discrètes |2 inriac | |
| 650 | 7 | |a théorie graphe |2 inriac | |
| 650 | 4 | |a Combinatorial analysis |v Congresses | |
| 650 | 4 | |a Computational complexity |v Congresses | |
| 650 | 4 | |a Graph theory |v Congresses | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Graphentheorie |0 (DE-588)4164748-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1990 |z Prachatitz |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Kombinatorische Graphentheorie |0 (DE-588)4164748-8 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Nešetřil, Jaroslav |d 1946- |e Sonstige |0 (DE-588)13380447X |4 oth | |
| 830 | 0 | |a Annals of discrete mathematics |v 51 |w (DE-604)BV004511910 |9 51 | |
| 856 | 4 | 2 | |m Digitalisierung TU Muenchen |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005282987&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 940 | 1 | |n oe | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005282987 | ||
Datensatz im Suchindex
| _version_ | 1804122393130565632 |
|---|---|
| adam_text | Contents
Preface
v
J.
Abrham,
Α.
Kotzig f:
Two Sequences of 2-Regular Graceful Graphs Con¬
sisting of 4-gons
.......................................................... 1
D. Archdeacon: A Survey of Self-Dual Polyhedra
.......................... 5
M. Bača:
On Magic Labellings of Convex Polytopes
......................... 13
V.
BÁLINT:
A Packing Problem and Geometrical Series
...................... 17
R. Bodendiek and K. Wagner: On the Bananas Surface B2
.............. 23
O. V. BORODIN: Structural Properties and Colorings of Plane Graphs
........ 31
M. Borowiecki: The Binding Number of Graphs
........................... 39
P. Bugata: Note on Algorithmic Solvability of Trahtenbrot-Zykov Problem
... 45
G. BUROSCH, P. V. Ceccherini: Cartesian
Dimensionsofa
Graph
......... 51
D. ClESLIK: The
Steiner
Minimal Tree Problem in Lj
........................ 59
T.
Dvořák:
On fc-Connected Subgraphs of the Hypercube
................... 63
P.
ERDŐS:
On Some of My Favourite Problems in Various Branches of Combi¬
natorics
.................................................................. 69
D. FronČEK:
Readability of Some Starlike Trees
........................... 81
H. Gropp: The Construction of All Configurations (124, 163)
................ 85
M. HorŇÁK: (p,
ç)-realizability
of Integer Sequences with Respect to
Möbius
Strip
.................................................................... 93
O. HUDEC:
Vertex Location Problems
....................................... 103
A. J.
C. HURKENS, C. A. J.
Hurkens,
R. W.
Whitty: On Generation of
a Class of Flowgraphs
.................................................... 107
J. IVANČO:
The Weight of a Graph
......................................... 113
F. Jaeger: On the Kauffman Polynomial of Planar Matroids
................. 117
S. Jendroľ:
On Symmetry Groups of Selfdual Convex Polyhedra
............. 129
V.
Jurák:
A Remark on 2-(i>, k, A) Designs
................................. 137
M. KOEBE: On a New Class of Intersection Graphs
.......................... 141
Urszula Konieczna:
Asymptotic Normality of Isolated Edges in Random Sub¬
graphs of the /¡-Cube
..................................................... 145
Vlil
Α.
V.
KOSTOCHKA,
L. S. MeľNIKOV:
On Bounds of the Bisection Width of
Cubic Graphs
............................................................ 151
A. V. Kostochka, A. A. Sapozhenko, K. Weber: On Random Cubical
Graphs
.................................................................. 155
J.
Kratochvíl,
J.
Nešetřil, O. Zýka:
On the Computational Complexity
of Seidel s Switching
...................................................... 161
A. Kundrik: The Harmonious Chromatic Number of a Graph
................ 167
A. Kurek:
Arboricity and Star Arboricity of Graphs
......................... 171
C. Lin, W. D.
Wallis,
Zhu Lie: Extended
4-Profiles
of
Hadamard
Matrices
175
M. Loebl, S.
Poljak:
Good Family Packing
.............................. 181
Z. Lonc: Solution of an Extremal Problem Concerning Edge-Partitions of Graphs
187
T.
Łuczak, A. RuciŃSKi:
Balanced Extensions of Spare Graphs
............. 191
A. Malnič
and B. Mohar: Two Results on Antisocial Families of Balls
___ 205
D. MaruŠIČ:
Hamiltonicity of Vertex-transitive pg-Graphs
................... 209
A. Meir and J. W. Moon: On Nodes of Given Out-Degree in Random Trees
213
E. Mendelsohn,
N.
Shalaby, Shen Hao: All Leaves and Excesses Are Re¬
alizable for
к
= 3
and All
λ
............................................... 223
Danuta
Michalak: The Binding Number of fc-Trees
....................... 229
P.
MlHÓK:
An Extension of Brook s Theorem
............................... 235
L. NEBESKÝ:
On Sectors in a Connected Graph
............................. 237
V. NÝDL:
Irreconstructability of Finite Undirected Graphs from Large Subgraphs
241
C. H. PapaDIMITRIOU: On Inefficient Proofs of Existence and Complexity
Classes
.................................................................. 245
C. H. PapaDIMITRIOU and Martha Sideri: Optimal Coteries on a Network
251
J. Plesnik: On Some Heuristics for the
Steiner
Problem in Graphs
........... 255
A. Raspaud: Cycle Covers of Graphs with a Nowhere-Zero 4-Flow (Abstract)
. 259
A. Recski:
Minimax
Results and Polynomial Algorithms in VLSI Routing
..... 261
D. G. Rogers: Critical Perfect Systems of Difference Sets
................... 275
Anna
Rycerz:
Some Operations (Not) Preserving the Integer Rounding Prop¬
erty
..................................................................... 281
Petra Scheffler:
Optimal Embedding of a Tree into an Interval Graph in
Linear Time
.............................................................. 287
їх
W.
SCHÖNE:
Construction of Polytopal Graphs
.............................. 293
J. J.
Seidel:
More About Two-Graphs
..................................... 297
J. Sheehan and
С
R. J. Clapham: These are the Two-free Trees
........ 309
S. K.
SlMlĆ:
A Note on Reconstructing the Characteristic Polynomial of a Graph
315
Z. SKUPIEŃ:
Exponential Constructions of Some Nonhamiltonian Minima
..... 321
M.
Sonntag: Hamiltonicity
of Products of Hypergraphs
..................... 329
M.
TKÁČ:
Non-Hamiltonian Simple 3-Polytopal Graphs with Edges of Only Two
Types
.................................................................... 333
S. V. Tsaranov: On Spectra of Trees and Related Two-Graphs
............. 337
V. VETCHÝ:
Metrically Regular Square of Metrically Regular Bigraphs
....... 341
M.
WoŹNlAK:
Embedding of Graphs in the Complements of Their Squares
... 345
A. Z. Zelikovsky: An ^--Approximation Algorithm for the
Steiner
Problem on
Graphs
.................................................................. 351
B. Zelinka:
Distances Between Graphs (Extended Abstract)
................. 355
B.
Zelinka: Domatic
Number of a Graph and its Variants (Extended Abstract)
363
A. A. Zykov: The Space of Graphs and its Factorizations
................... 371
Problems Proposed at the Problem Session of the
Prachatice
Conference on Graph
Theory
.................................................................. 375
List of Participants
......................................................... 385
Name Index
................................................................ 389
Subject Index
............................................................... 397
|
| any_adam_object | 1 |
| author_GND | (DE-588)13380447X |
| author_corporate | Czechoslovakian Symposium on Combinatorics, Graphs and Complexity Prachatice |
| author_corporate_role | aut |
| author_facet | Czechoslovakian Symposium on Combinatorics, Graphs and Complexity Prachatice |
| author_sort | Czechoslovakian Symposium on Combinatorics, Graphs and Complexity Prachatice |
| building | Verbundindex |
| bvnumber | BV008028751 |
| callnumber-first | Q - Science |
| callnumber-label | QA164 |
| callnumber-raw | QA164 |
| callnumber-search | QA164 |
| callnumber-sort | QA 3164 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SD 1990 SK 890 |
| classification_tum | MAT 050f DAT 517f |
| ctrlnum | (OCoLC)25710840 (DE-599)BVBBV008028751 |
| dewey-full | 511/.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.6 |
| dewey-search | 511/.6 |
| dewey-sort | 3511 16 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02945nam a2200709 cb4500</leader><controlfield tag="001">BV008028751</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150108 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930713s1992 ad|| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444895434</subfield><subfield code="9">0-444-89543-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25710840</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008028751</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA164</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.6</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SD 1990</subfield><subfield code="0">(DE-625)142724:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 050f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Czechoslovakian Symposium on Combinatorics, Graphs and Complexity</subfield><subfield code="n">4</subfield><subfield code="d">1990</subfield><subfield code="c">Prachatice</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)5060599-9</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity</subfield><subfield code="c">ed. by Jaroslav Nešetřil ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam [u.a.]</subfield><subfield code="b">North-Holland</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 400 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Annals of discrete mathematics</subfield><subfield code="v">51</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analyse combinatoire - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Analyse combinatoire - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique) - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (Informatique) - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes, théorie des - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">analyse combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">mathématiques discrètes</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Graphentheorie</subfield><subfield code="0">(DE-588)4164748-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1990</subfield><subfield code="z">Prachatitz</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kombinatorische Graphentheorie</subfield><subfield code="0">(DE-588)4164748-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nešetřil, Jaroslav</subfield><subfield code="d">1946-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)13380447X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Annals of discrete mathematics</subfield><subfield code="v">51</subfield><subfield code="w">(DE-604)BV004511910</subfield><subfield code="9">51</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung TU Muenchen</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005282987&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="n">oe</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005282987</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1990 Prachatitz gnd-content |
| genre_facet | Konferenzschrift 1990 Prachatitz |
| id | DE-604.BV008028751 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:13:09Z |
| institution | BVB |
| institution_GND | (DE-588)5060599-9 |
| isbn | 0444895434 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005282987 |
| oclc_num | 25710840 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-12 DE-11 DE-188 DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-12 DE-11 DE-188 DE-706 |
| physical | IX, 400 S. Ill., graph. Darst. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | North-Holland |
| record_format | marc |
| series | Annals of discrete mathematics |
| series2 | Annals of discrete mathematics |
| spelling | Czechoslovakian Symposium on Combinatorics, Graphs and Complexity 4 1990 Prachatice Verfasser (DE-588)5060599-9 aut Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity ed. by Jaroslav Nešetřil ... Amsterdam [u.a.] North-Holland 1992 IX, 400 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Annals of discrete mathematics 51 Literaturangaben Analyse combinatoire - Congrès Analyse combinatoire - Congrès ram Complexité de calcul (Informatique) - Congrès Complexité de calcul (Informatique) - Congrès ram Graphes, Théorie des - Congrès Graphes, théorie des - Congrès ram analyse combinatoire inriac combinatoire inriac complexité algorithme inriac complexité inriac graphe inriac mathématiques discrètes inriac théorie graphe inriac Combinatorial analysis Congresses Computational complexity Congresses Graph theory Congresses Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Kombinatorische Graphentheorie (DE-588)4164748-8 gnd rswk-swf Kombinatorische Analysis (DE-588)4164746-4 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1990 Prachatitz gnd-content Kombinatorische Analysis (DE-588)4164746-4 s DE-604 Kombinatorische Graphentheorie (DE-588)4164748-8 s Komplexitätstheorie (DE-588)4120591-1 s Nešetřil, Jaroslav 1946- Sonstige (DE-588)13380447X oth Annals of discrete mathematics 51 (DE-604)BV004511910 51 Digitalisierung TU Muenchen application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005282987&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity Annals of discrete mathematics Analyse combinatoire - Congrès Analyse combinatoire - Congrès ram Complexité de calcul (Informatique) - Congrès Complexité de calcul (Informatique) - Congrès ram Graphes, Théorie des - Congrès Graphes, théorie des - Congrès ram analyse combinatoire inriac combinatoire inriac complexité algorithme inriac complexité inriac graphe inriac mathématiques discrètes inriac théorie graphe inriac Combinatorial analysis Congresses Computational complexity Congresses Graph theory Congresses Komplexitätstheorie (DE-588)4120591-1 gnd Kombinatorische Graphentheorie (DE-588)4164748-8 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4164748-8 (DE-588)4164746-4 (DE-588)1071861417 |
| title | Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity |
| title_auth | Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity |
| title_exact_search | Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity |
| title_full | Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity ed. by Jaroslav Nešetřil ... |
| title_fullStr | Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity ed. by Jaroslav Nešetřil ... |
| title_full_unstemmed | Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity ed. by Jaroslav Nešetřil ... |
| title_short | Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity |
| title_sort | fourth czechoslovakian symposium on combinatorics graphs and complexity |
| topic | Analyse combinatoire - Congrès Analyse combinatoire - Congrès ram Complexité de calcul (Informatique) - Congrès Complexité de calcul (Informatique) - Congrès ram Graphes, Théorie des - Congrès Graphes, théorie des - Congrès ram analyse combinatoire inriac combinatoire inriac complexité algorithme inriac complexité inriac graphe inriac mathématiques discrètes inriac théorie graphe inriac Combinatorial analysis Congresses Computational complexity Congresses Graph theory Congresses Komplexitätstheorie (DE-588)4120591-1 gnd Kombinatorische Graphentheorie (DE-588)4164748-8 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd |
| topic_facet | Analyse combinatoire - Congrès Complexité de calcul (Informatique) - Congrès Graphes, Théorie des - Congrès Graphes, théorie des - Congrès analyse combinatoire combinatoire complexité algorithme complexité graphe mathématiques discrètes théorie graphe Combinatorial analysis Congresses Computational complexity Congresses Graph theory Congresses Komplexitätstheorie Kombinatorische Graphentheorie Kombinatorische Analysis Konferenzschrift 1990 Prachatitz |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005282987&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV004511910 |
| work_keys_str_mv | AT czechoslovakiansymposiumoncombinatoricsgraphsandcomplexityprachatice fourthczechoslovakiansymposiumoncombinatoricsgraphsandcomplexity AT nesetriljaroslav fourthczechoslovakiansymposiumoncombinatoricsgraphsandcomplexity |