Sufficient conditions for graphs to contain all subgraphs of a given type:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
1994
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | 83 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV009751509 | ||
003 | DE-604 | ||
007 | t | ||
008 | 940803s1994 gw d||| m||| 00||| eng d | ||
016 | 7 | |a 941509818 |2 DE-101 | |
035 | |a (OCoLC)56722356 | ||
035 | |a (DE-599)BVBBV009751509 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-29T |a DE-12 |a DE-824 |a DE-11 |a DE-188 | ||
100 | 1 | |a Brandt, Stephan |e Verfasser |4 aut | |
245 | 1 | 0 | |a Sufficient conditions for graphs to contain all subgraphs of a given type |c vorgelegt von Stephan Brandt |
264 | 1 | |c 1994 | |
300 | |a 83 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
502 | |a Berlin, Freie Univ., Diss., 1994 | ||
650 | 0 | 7 | |a Bipartiter Graph |0 (DE-588)4145661-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Dreieckfreier Graph |0 (DE-588)4212349-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Bipartiter Graph |0 (DE-588)4145661-0 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Dreieckfreier Graph |0 (DE-588)4212349-5 |D s |
689 | 1 | |5 DE-604 | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006449801&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006449801 |
Datensatz im Suchindex
_version_ | 1807682472495808512 |
---|---|
adam_text |
CONTENTS
0
INTRODUCTION
3
1
NOTATION
AND
PRELIMINARY
RESULTS
6
PART
I
CYCLES
AND
PATHS
11
2
CYCLES
AND
PATHS
IN
TRIANGLE-FREE
GRAPHS
13
2.1
MAIN
RESULTS
.
14
2.2
MATCHINGS
AND
INDEPENDENCE
NUMBER
.
16
2.3
LASSOS
.
19
2.4
PROOFS
OF
THE
MAIN
RESULTS
.
23
3
WEAKLY
PANCYCLIC
GRAPHS
25
3.1
SUFFICIENT
CONDITIONS
FOR
WEAKLY
PANCYCLIC
GRAPHS
.
26
3.2
APPLICATIONS
TO
PANCYCLIC
GRAPHS
.
27
3.3
NEGATIVE
RESULTS
FOR
PANCYCLIC
AND
WEAKLY
PANCYCLIC
GRAPHS
.
29
3.4
PROOF
OF
THE
EDGE
NUMBER
RESULT
.
32
3.5
PROOF
OF
THE
DEGREE
RESULT
.
33
PART
II
EXTREMAL
RESULTS
51
4
EXTREMAL
THEORY
AND
PACKING
53
4.1
PACKING
VERSUS
EMBEDDING
.
54
4.2
K-DEGENERATE
GRAPHS
.
55
4.3
EMBEDDING
GRAPHS
WITHOUT
SHORT
CYCLES
IN
THEIR
COMPLEMENTS
.
57
5
SUBTREES
AND
SUBFORESTS
OF
GRAPHS
62
5.1
SUBFORESTS
OF
GRAPHS
.
62
5.2
TWO
APPLICATIONS
.
66
2
6
AN
EXTREMAL
RESULT
FOR
SUBGRAPHS
WITH
FEW
EDGES
69
6.1
EXTREMAL
THEORY
AND
SUBGRAPHS
WITH
FEW
EDGES
.
69
6.2
CALCULATING
G(N,M)
.
71
BIBLIOGRAPHY
77
ZUSAMMENFASSUNG
82
LEBENSLAUF
83 |
any_adam_object | 1 |
author | Brandt, Stephan |
author_facet | Brandt, Stephan |
author_role | aut |
author_sort | Brandt, Stephan |
author_variant | s b sb |
building | Verbundindex |
bvnumber | BV009751509 |
ctrlnum | (OCoLC)56722356 (DE-599)BVBBV009751509 |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV009751509</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940803s1994 gw d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">941509818</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)56722356</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009751509</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brandt, Stephan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sufficient conditions for graphs to contain all subgraphs of a given type</subfield><subfield code="c">vorgelegt von Stephan Brandt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">83 S.</subfield><subfield code="b">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="502" ind1=" " ind2=" "><subfield code="a">Berlin, Freie Univ., Diss., 1994</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Bipartiter Graph</subfield><subfield code="0">(DE-588)4145661-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dreieckfreier Graph</subfield><subfield code="0">(DE-588)4212349-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Bipartiter Graph</subfield><subfield code="0">(DE-588)4145661-0</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">Dreieckfreier Graph</subfield><subfield code="0">(DE-588)4212349-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=006449801&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006449801</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV009751509 |
illustrated | Illustrated |
indexdate | 2024-08-18T00:19:04Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006449801 |
oclc_num | 56722356 |
open_access_boolean | |
owner | DE-29T DE-12 DE-824 DE-11 DE-188 |
owner_facet | DE-29T DE-12 DE-824 DE-11 DE-188 |
physical | 83 S. graph. Darst. |
publishDate | 1994 |
publishDateSearch | 1994 |
publishDateSort | 1994 |
record_format | marc |
spelling | Brandt, Stephan Verfasser aut Sufficient conditions for graphs to contain all subgraphs of a given type vorgelegt von Stephan Brandt 1994 83 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Berlin, Freie Univ., Diss., 1994 Bipartiter Graph (DE-588)4145661-0 gnd rswk-swf Dreieckfreier Graph (DE-588)4212349-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Bipartiter Graph (DE-588)4145661-0 s DE-604 Dreieckfreier Graph (DE-588)4212349-5 s DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006449801&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Brandt, Stephan Sufficient conditions for graphs to contain all subgraphs of a given type Bipartiter Graph (DE-588)4145661-0 gnd Dreieckfreier Graph (DE-588)4212349-5 gnd |
subject_GND | (DE-588)4145661-0 (DE-588)4212349-5 (DE-588)4113937-9 |
title | Sufficient conditions for graphs to contain all subgraphs of a given type |
title_auth | Sufficient conditions for graphs to contain all subgraphs of a given type |
title_exact_search | Sufficient conditions for graphs to contain all subgraphs of a given type |
title_full | Sufficient conditions for graphs to contain all subgraphs of a given type vorgelegt von Stephan Brandt |
title_fullStr | Sufficient conditions for graphs to contain all subgraphs of a given type vorgelegt von Stephan Brandt |
title_full_unstemmed | Sufficient conditions for graphs to contain all subgraphs of a given type vorgelegt von Stephan Brandt |
title_short | Sufficient conditions for graphs to contain all subgraphs of a given type |
title_sort | sufficient conditions for graphs to contain all subgraphs of a given type |
topic | Bipartiter Graph (DE-588)4145661-0 gnd Dreieckfreier Graph (DE-588)4212349-5 gnd |
topic_facet | Bipartiter Graph Dreieckfreier Graph Hochschulschrift |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006449801&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT brandtstephan sufficientconditionsforgraphstocontainallsubgraphsofagiventype |