Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jct/jctb30.bht:"
download as .bib file
@article{DBLP:journals/jct/AdamsNS81,
author = {M. E. Adams and
Jaroslav Nesetril and
Jir{\'{\i}} Sichler},
title = {Quotients of rigid graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {351--359},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90052-6},
doi = {10.1016/0095-8956(81)90052-6},
timestamp = {Fri, 29 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/AdamsNS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AngluinG81,
author = {Dana Angluin and
A. Gardiner},
title = {Finite common coverings of pairs of regular graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {184--187},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90062-9},
doi = {10.1016/0095-8956(81)90062-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/AngluinG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Anstee81a,
author = {Richard P. Anstee},
title = {An analogue of group divisible designs for Moore graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {11--20},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90086-1},
doi = {10.1016/0095-8956(81)90086-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Anstee81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BennettS81,
author = {Frank E. Bennett and
Dominique Sotteau},
title = {Almost resolvable decomposition of K\({}_{\mbox{n}}\)\({}^{\mbox{*}}\)},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {228--232},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90067-8},
doi = {10.1016/0095-8956(81)90067-8},
timestamp = {Fri, 29 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BennettS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Berman81,
author = {Kenneth A. Berman},
title = {Three-colourings of planar 4-valent maps},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {82--88},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90094-0},
doi = {10.1016/0095-8956(81)90094-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Berman81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Berman81a,
author = {Kenneth A. Berman},
title = {Matchings and spanning trees in Boolean weighted graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {343--350},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90051-4},
doi = {10.1016/0095-8956(81)90051-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Berman81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BollobasC81,
author = {B{\'{e}}la Bollob{\'{a}}s and
Paul A. Catlin},
title = {Topological cliques of random graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {224--227},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90066-6},
doi = {10.1016/0095-8956(81)90066-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BollobasC81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BollobasGW81,
author = {B{\'{e}}la Bollob{\'{a}}s and
Donald L. Goldsmith and
Douglas R. Woodall},
title = {Indestructive deletions of edges from graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {263--275},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90043-5},
doi = {10.1016/0095-8956(81)90043-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BollobasGW81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BridgesM81,
author = {William G. Bridges and
R. A. Mena},
title = {X\({}^{\mbox{k}}\)-Digraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {136--143},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90059-9},
doi = {10.1016/0095-8956(81)90059-9},
timestamp = {Sat, 01 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BridgesM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Bry81,
author = {Fran{\c{c}}ois Bry},
title = {Note on a theorem of J. Folkman on transversals of infinite families
with finitely many infinite members},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {100--102},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90098-8},
doi = {10.1016/0095-8956(81)90098-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Bry81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Brylawski81,
author = {Tom Brylawski},
title = {Intersection theory for graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {233--246},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90068-X},
doi = {10.1016/0095-8956(81)90068-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Brylawski81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Busolini81,
author = {D. T. Busolini},
title = {2-Colored triangles in edge-colored complete graphs, {II}},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {360--363},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90053-8},
doi = {10.1016/0095-8956(81)90053-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Busolini81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Cunningham81,
author = {William H. Cunningham},
title = {On matroid connectivity},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {94--99},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90097-6},
doi = {10.1016/0095-8956(81)90097-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Cunningham81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Denig81,
author = {W. A. Denig},
title = {A class of matroids derived from saturated chain partitions of partially
ordered sets},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {302--317},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90048-4},
doi = {10.1016/0095-8956(81)90048-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Denig81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Enomoto81,
author = {Hikoe Enomoto},
title = {Combinatorially homogeneous graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {215--223},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90065-4},
doi = {10.1016/0095-8956(81)90065-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Enomoto81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/EvansPS81,
author = {R. J. Evans and
J. R. Pulham and
J. Sheehan},
title = {On the number of complete subgraphs contained in certain graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {364--371},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90054-X},
doi = {10.1016/0095-8956(81)90054-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/EvansPS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Feinberg81,
author = {Martin Feinberg},
title = {On a generalization of linear independence in finite-dimensional vector
spaces},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {61--69},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90091-5},
doi = {10.1016/0095-8956(81)90091-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Feinberg81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FioriniL81,
author = {Stanley Fiorini and
Josef Lauri},
title = {The reconstruction of maximal planar graphs. I. Recognition},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {188--195},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90063-0},
doi = {10.1016/0095-8956(81)90063-0},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FioriniL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Gaffke81,
author = {N. Gaffke},
title = {Connected graphs with a minimal number of spanning trees},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {166--183},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90061-7},
doi = {10.1016/0095-8956(81)90061-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Gaffke81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GodsilM81,
author = {Chris D. Godsil and
Brendan D. McKay},
title = {Spectral conditions for the reconstructibility of a graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {285--289},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90046-0},
doi = {10.1016/0095-8956(81)90046-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GodsilM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Grinstead81,
author = {Charles M. Grinstead},
title = {The strong perfect graph conjecture for toroifal graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {70--74},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90092-7},
doi = {10.1016/0095-8956(81)90092-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Grinstead81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HaggkvistN81,
author = {Roland H{\"{a}}ggkvist and
G. G. Nicoghossian},
title = {A remark on Hamiltonian cycles},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {118--120},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90102-7},
doi = {10.1016/0095-8956(81)90102-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HaggkvistN81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Hahn81,
author = {Gena Hahn},
title = {The automorphism group of a product of hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {276--281},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90044-7},
doi = {10.1016/0095-8956(81)90044-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Hahn81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Hamidoune81,
author = {Yahya Ould Hamidoune},
title = {Quelques probl{\`{e}}mes de connexit{\'{e}} dans les graphes
orient{\'{e}}s},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {1--10},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90085-X},
doi = {10.1016/0095-8956(81)90085-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Hamidoune81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Hamidoune81a,
author = {Yahya Ould Hamidoune},
title = {On multiply critically h-connected graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {108--112},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90100-3},
doi = {10.1016/0095-8956(81)90100-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Hamidoune81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Hammond81,
author = {Peter Hammond},
title = {q-Coverings, codes, and line graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {32--35},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90088-5},
doi = {10.1016/0095-8956(81)90088-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Hammond81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HarantW81,
author = {Jochen Harant and
Hansjoachim Walther},
title = {On the radius of graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {113--117},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90101-5},
doi = {10.1016/0095-8956(81)90101-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HarantW81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Jackson81,
author = {Bill Jackson},
title = {Cycles in bipartite graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {332--342},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90050-2},
doi = {10.1016/0095-8956(81)90050-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Jackson81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Jeurissen81,
author = {R. H. Jeurissen},
title = {The incidence matrix and labelings of a graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {290--301},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90047-2},
doi = {10.1016/0095-8956(81)90047-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Jeurissen81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kelly81,
author = {John B. Kelly},
title = {Difference systems, graph designs, and coloring problems},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {144--165},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90060-5},
doi = {10.1016/0095-8956(81)90060-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kelly81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KirkpatrickC81,
author = {David G. Kirkpatrick and
Derek G. Corneil},
title = {Forest embeddings in regular graphs of large girth},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {45--60},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90090-3},
doi = {10.1016/0095-8956(81)90090-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KirkpatrickC81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kovacs81,
author = {Peter Kov{\'{a}}cs},
title = {The non-existence of certain regular graphs of girth 5},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {282--284},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90045-9},
doi = {10.1016/0095-8956(81)90045-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kovacs81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lauri81,
author = {Josef Lauri},
title = {The reconstruction of maximal planar graphs {II.} Reconstruction},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {196--214},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90064-2},
doi = {10.1016/0095-8956(81)90064-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lauri81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lins81,
author = {S{\'{o}}stenes Lins},
title = {A minimax theorem on circuits in projective graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {253--262},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90042-3},
doi = {10.1016/0095-8956(81)90042-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lins81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Marcus81,
author = {Daniel A. Marcus},
title = {Spanning subgraphs of k-connected digraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {21--31},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90087-3},
doi = {10.1016/0095-8956(81)90087-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Marcus81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Neumaier81,
author = {Arnold Neumaier},
title = {Classification of graphs by regularity},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {3},
pages = {318--331},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90049-6},
doi = {10.1016/0095-8956(81)90049-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Neumaier81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PerrinS81,
author = {D. Perrin and
Marcel Paul Sch{\"{u}}tzenberger},
title = {A conjecture on sets of differences of integer pairs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {91--93},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90096-4},
doi = {10.1016/0095-8956(81)90096-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/PerrinS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Schmeichel81,
author = {Edward F. Schmeichel},
title = {The basis number of a graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {123--129},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90057-5},
doi = {10.1016/0095-8956(81)90057-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Schmeichel81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Schwenk81,
author = {Allen J. Schwenk},
title = {On unimodal sequences of graphical invariants},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {247--250},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90069-1},
doi = {10.1016/0095-8956(81)90069-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Schwenk81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Seymour81a,
author = {Paul D. Seymour},
title = {Nowhere-zero 6-flows},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {2},
pages = {130--135},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90058-7},
doi = {10.1016/0095-8956(81)90058-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Seymour81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Sotteau81,
author = {Dominique Sotteau},
title = {Decomposition of K\({}_{\mbox{m, n}}\)(K\({}_{\mbox{m, n}}\)\({}^{\mbox{*}}\))
into cycles (circuits) of length 2k},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {75--81},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90093-9},
doi = {10.1016/0095-8956(81)90093-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Sotteau81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Thomassen81,
author = {Carsten Thomassen},
title = {Planar cubic hypohamiltonian and hypotraceable graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {36--44},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90089-7},
doi = {10.1016/0095-8956(81)90089-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Thomassen81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Wright81,
author = {Edward M. Wright},
title = {Burnside's lemma: {A} historical note},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {89--90},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90095-2},
doi = {10.1016/0095-8956(81)90095-2},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Wright81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Zaverdinos81,
author = {C. Zaverdinos},
title = {Hall-conditions and the three-family problem},
journal = {J. Comb. Theory, Ser. {B}},
volume = {30},
number = {1},
pages = {103--107},
year = {1981},
url = {https://doi.org/10.1016/0095-8956(81)90099-X},
doi = {10.1016/0095-8956(81)90099-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Zaverdinos81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-30 11:28 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
