Finding good 2-partitions of digraphs II. Enumerable properties

Gespeichert in:

Autor*in:	Bang-Jensen, J [verfasserIn] Cohen, Nathann Havet, Frédéric

Format:	Artikel
Sprache:	Englisch

Erschienen:	2016

Systematik:	SQ 1100:

Übergeordnetes Werk:	Enthalten in: Theoretical computer science - Amsterdam [u.a.] : Elsevier, 1975, 640(2016), Seite 1-19
Übergeordnetes Werk:	volume:640 ; year:2016 ; pages:1-19

Links:	Volltext

DOI / URN:	10.1016/j.tcs.2016.05.034

Katalog-ID:	OLC1979770646

Internformat


LEADER	01000caa a2200265 4500
001	OLC1979770646
003	DE-627
005	20220221163516.0
007	tu
008	160816s2016 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1016/j.tcs.2016.05.034 \|2 doi
028	5	2	\|a PQ20160815
035			\|a (DE-627)OLC1979770646
035			\|a (DE-599)GBVOLC1979770646
035			\|a (PRQ)crossref_primary_10_1016_j_tcs_2016_05_0340
035			\|a (KEY)0008746720160000640000000001findinggood2partitionsofdigraphsiienumerableproper
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 004 \|q DNB
084			\|a SQ 1100: \|q AVZ \|2 rvk
084			\|a 54.10 \|2 bkl
100	1		\|a Bang-Jensen, J \|e verfasserin \|4 aut
245	1	0	\|a Finding good 2-partitions of digraphs II. Enumerable properties
264		1	\|c 2016
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
700	1		\|a Cohen, Nathann \|4 oth
700	1		\|a Havet, Frédéric \|4 oth
773	0	8	\|i Enthalten in \|t Theoretical computer science \|d Amsterdam [u.a.] : Elsevier, 1975 \|g 640(2016), Seite 1-19 \|w (DE-627)129435333 \|w (DE-600)193706-6 \|w (DE-576)014806770 \|x 0304-3975 \|7 nnns
773	1	8	\|g volume:640 \|g year:2016 \|g pages:1-19
856	4	1	\|u http://dx.doi.org/10.1016/j.tcs.2016.05.034 \|3 Volltext
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-TEC
912			\|a SSG-OLC-MAT
912			\|a GBV_ILN_21
912			\|a GBV_ILN_65
912			\|a GBV_ILN_70
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4318
936	r	v	\|a SQ 1100:
936	b	k	\|a 54.10 \|q AVZ
951			\|a AR
952			\|d 640 \|j 2016 \|h 1-19

Indexfelder

author_variant	j b j jbj
matchkey_str	article:03043975:2016----::idngo2attosfirpsinm
hierarchy_sort_str	2016
bklnumber	54.10
publishDate	2016
allfields	10.1016/j.tcs.2016.05.034 doi PQ20160815 (DE-627)OLC1979770646 (DE-599)GBVOLC1979770646 (PRQ)crossref_primary_10_1016_j_tcs_2016_05_0340 (KEY)0008746720160000640000000001findinggood2partitionsofdigraphsiienumerableproper DE-627 ger DE-627 rakwb eng 004 DNB SQ 1100: AVZ rvk 54.10 bkl Bang-Jensen, J verfasserin aut Finding good 2-partitions of digraphs II. Enumerable properties 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Cohen, Nathann oth Havet, Frédéric oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 640(2016), Seite 1-19 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:640 year:2016 pages:1-19 http://dx.doi.org/10.1016/j.tcs.2016.05.034 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_65 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4305 GBV_ILN_4318 SQ 1100: 54.10 AVZ AR 640 2016 1-19
spelling	10.1016/j.tcs.2016.05.034 doi PQ20160815 (DE-627)OLC1979770646 (DE-599)GBVOLC1979770646 (PRQ)crossref_primary_10_1016_j_tcs_2016_05_0340 (KEY)0008746720160000640000000001findinggood2partitionsofdigraphsiienumerableproper DE-627 ger DE-627 rakwb eng 004 DNB SQ 1100: AVZ rvk 54.10 bkl Bang-Jensen, J verfasserin aut Finding good 2-partitions of digraphs II. Enumerable properties 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Cohen, Nathann oth Havet, Frédéric oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 640(2016), Seite 1-19 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:640 year:2016 pages:1-19 http://dx.doi.org/10.1016/j.tcs.2016.05.034 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_65 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4305 GBV_ILN_4318 SQ 1100: 54.10 AVZ AR 640 2016 1-19
allfields_unstemmed	10.1016/j.tcs.2016.05.034 doi PQ20160815 (DE-627)OLC1979770646 (DE-599)GBVOLC1979770646 (PRQ)crossref_primary_10_1016_j_tcs_2016_05_0340 (KEY)0008746720160000640000000001findinggood2partitionsofdigraphsiienumerableproper DE-627 ger DE-627 rakwb eng 004 DNB SQ 1100: AVZ rvk 54.10 bkl Bang-Jensen, J verfasserin aut Finding good 2-partitions of digraphs II. Enumerable properties 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Cohen, Nathann oth Havet, Frédéric oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 640(2016), Seite 1-19 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:640 year:2016 pages:1-19 http://dx.doi.org/10.1016/j.tcs.2016.05.034 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_65 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4305 GBV_ILN_4318 SQ 1100: 54.10 AVZ AR 640 2016 1-19
allfieldsGer	10.1016/j.tcs.2016.05.034 doi PQ20160815 (DE-627)OLC1979770646 (DE-599)GBVOLC1979770646 (PRQ)crossref_primary_10_1016_j_tcs_2016_05_0340 (KEY)0008746720160000640000000001findinggood2partitionsofdigraphsiienumerableproper DE-627 ger DE-627 rakwb eng 004 DNB SQ 1100: AVZ rvk 54.10 bkl Bang-Jensen, J verfasserin aut Finding good 2-partitions of digraphs II. Enumerable properties 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Cohen, Nathann oth Havet, Frédéric oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 640(2016), Seite 1-19 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:640 year:2016 pages:1-19 http://dx.doi.org/10.1016/j.tcs.2016.05.034 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_65 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4305 GBV_ILN_4318 SQ 1100: 54.10 AVZ AR 640 2016 1-19
allfieldsSound	10.1016/j.tcs.2016.05.034 doi PQ20160815 (DE-627)OLC1979770646 (DE-599)GBVOLC1979770646 (PRQ)crossref_primary_10_1016_j_tcs_2016_05_0340 (KEY)0008746720160000640000000001findinggood2partitionsofdigraphsiienumerableproper DE-627 ger DE-627 rakwb eng 004 DNB SQ 1100: AVZ rvk 54.10 bkl Bang-Jensen, J verfasserin aut Finding good 2-partitions of digraphs II. Enumerable properties 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Cohen, Nathann oth Havet, Frédéric oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 640(2016), Seite 1-19 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:640 year:2016 pages:1-19 http://dx.doi.org/10.1016/j.tcs.2016.05.034 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_65 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4305 GBV_ILN_4318 SQ 1100: 54.10 AVZ AR 640 2016 1-19
language	English
source	Enthalten in Theoretical computer science 640(2016), Seite 1-19 volume:640 year:2016 pages:1-19
sourceStr	Enthalten in Theoretical computer science 640(2016), Seite 1-19 volume:640 year:2016 pages:1-19
format_phy_str_mv	Article
institution	findex.gbv.de
dewey-raw	004
isfreeaccess_bool	false
container_title	Theoretical computer science
authorswithroles_txt_mv	Bang-Jensen, J @@aut@@ Cohen, Nathann @@oth@@ Havet, Frédéric @@oth@@
publishDateDaySort_date	2016-01-01T00:00:00Z
hierarchy_top_id	129435333
dewey-sort	14
id	OLC1979770646
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1979770646</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221163516.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160816s2016 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2016.05.034</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160815</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1979770646</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1979770646</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)crossref_primary_10_1016_j_tcs_2016_05_0340</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0008746720160000640000000001findinggood2partitionsofdigraphsiienumerableproper</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SQ 1100:</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bang-Jensen, J</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding good 2-partitions of digraphs II. Enumerable properties</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cohen, Nathann</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Havet, Frédéric</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theoretical computer science</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1975</subfield><subfield code="g">640(2016), Seite 1-19</subfield><subfield code="w">(DE-627)129435333</subfield><subfield code="w">(DE-600)193706-6</subfield><subfield code="w">(DE-576)014806770</subfield><subfield code="x">0304-3975</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:640</subfield><subfield code="g">year:2016</subfield><subfield code="g">pages:1-19</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1016/j.tcs.2016.05.034</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SQ 1100:</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.10</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">640</subfield><subfield code="j">2016</subfield><subfield code="h">1-19</subfield></datafield></record></collection>
author	Bang-Jensen, J
spellingShingle	Bang-Jensen, J ddc 004 rvk SQ 1100: bkl 54.10 Finding good 2-partitions of digraphs II. Enumerable properties
authorStr	Bang-Jensen, J
ppnlink_with_tag_str_mv	@@773@@(DE-627)129435333
format	Article
dewey-ones	004 - Data processing & computer science
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0304-3975
topic_title	004 DNB SQ 1100: AVZ rvk 54.10 bkl Finding good 2-partitions of digraphs II. Enumerable properties
topic	ddc 004 rvk SQ 1100: bkl 54.10
topic_unstemmed	ddc 004 rvk SQ 1100: bkl 54.10
topic_browse	ddc 004 rvk SQ 1100: bkl 54.10
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	n c nc f h fh
hierarchy_parent_title	Theoretical computer science
hierarchy_parent_id	129435333
dewey-tens	000 - Computer science, knowledge & systems
hierarchy_top_title	Theoretical computer science
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)129435333 (DE-600)193706-6 (DE-576)014806770
title	Finding good 2-partitions of digraphs II. Enumerable properties
ctrlnum	(DE-627)OLC1979770646 (DE-599)GBVOLC1979770646 (PRQ)crossref_primary_10_1016_j_tcs_2016_05_0340 (KEY)0008746720160000640000000001findinggood2partitionsofdigraphsiienumerableproper
title_full	Finding good 2-partitions of digraphs II. Enumerable properties
author_sort	Bang-Jensen, J
journal	Theoretical computer science
journalStr	Theoretical computer science
lang_code	eng
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works
recordtype	marc
publishDateSort	2016
contenttype_str_mv	txt
container_start_page	1
author_browse	Bang-Jensen, J
container_volume	640
class	004 DNB SQ 1100: AVZ rvk 54.10 bkl
format_se	Aufsätze
author-letter	Bang-Jensen, J
doi_str_mv	10.1016/j.tcs.2016.05.034
dewey-full	004
title_sort	finding good 2-partitions of digraphs ii. enumerable properties
title_auth	Finding good 2-partitions of digraphs II. Enumerable properties
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_65 GBV_ILN_70 GBV_ILN_4126 GBV_ILN_4305 GBV_ILN_4318
title_short	Finding good 2-partitions of digraphs II. Enumerable properties
url	http://dx.doi.org/10.1016/j.tcs.2016.05.034
remote_bool	false
author2	Cohen, Nathann Havet, Frédéric
author2Str	Cohen, Nathann Havet, Frédéric
ppnlink	129435333
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth oth
doi_str	10.1016/j.tcs.2016.05.034
up_date	2024-07-04T01:38:19.616Z
_version_	1803610593289043968
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1979770646</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221163516.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160816s2016 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2016.05.034</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160815</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1979770646</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1979770646</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)crossref_primary_10_1016_j_tcs_2016_05_0340</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0008746720160000640000000001findinggood2partitionsofdigraphsiienumerableproper</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SQ 1100:</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bang-Jensen, J</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding good 2-partitions of digraphs II. Enumerable properties</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cohen, Nathann</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Havet, Frédéric</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theoretical computer science</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1975</subfield><subfield code="g">640(2016), Seite 1-19</subfield><subfield code="w">(DE-627)129435333</subfield><subfield code="w">(DE-600)193706-6</subfield><subfield code="w">(DE-576)014806770</subfield><subfield code="x">0304-3975</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:640</subfield><subfield code="g">year:2016</subfield><subfield code="g">pages:1-19</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1016/j.tcs.2016.05.034</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SQ 1100:</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.10</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">640</subfield><subfield code="j">2016</subfield><subfield code="h">1-19</subfield></datafield></record></collection>
score	7.399292

Nicht das Richtige dabei?

Schreiben Sie uns!

Finding good 2-partitions of digraphs II. Enumerable properties

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?