Search dblp for Publications

export results for "toc:db/journals/combinatorica/combinatorica4.bht:"

 download as .bib file

@article{DBLP:journals/combinatorica/Aharoni84,
  author       = {Ron Aharoni},
  title        = {On an obstruction for perfect matching},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {1--7},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579151},
  doi          = {10.1007/BF02579151},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Aharoni84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AjtaiKT84,
  author       = {Mikl{\'{o}}s Ajtai and
                  J{\'{a}}nos Koml{\'{o}}s and
                  G{\'{a}}bor E. Tusn{\'{a}}dy},
  title        = {On optimal matchings},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {259--264},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579135},
  doi          = {10.1007/BF02579135},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/AjtaiKT84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BollobasK84,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Victor Klee},
  title        = {Diameters of random bipartite graphs},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {7--19},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579152},
  doi          = {10.1007/BF02579152},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/BollobasK84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DawsonSS84,
  author       = {Jeremy E. Dawson and
                  Jennifer Seberry and
                  David B. Skillicorn},
  title        = {The directed packing numbers {DD} (t, v, v), t{\textgreater}=;4},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {121--130},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579211},
  doi          = {10.1007/BF02579211},
  timestamp    = {Fri, 19 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/combinatorica/DawsonSS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Elekes84,
  author       = {Gy{\"{o}}rgy Elekes},
  title        = {n points in the plane can determine n \({}^{\mbox{3/2}}\) unit circles},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {131},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579212},
  doi          = {10.1007/BF02579212},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Elekes84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EllinghamHL84,
  author       = {Mark N. Ellingham and
                  Derek A. Holton and
                  Charles H. C. Little},
  title        = {Cycles through ten vertices in 3-connected cubic graphs},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {265--273},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579136},
  doi          = {10.1007/BF02579136},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/EllinghamHL84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Engel84,
  author       = {Konrad Engel},
  title        = {An Erd{\"{o}}s - Ko- Rado theorem for the subcubes of a cube},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {133--140},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579213},
  doi          = {10.1007/BF02579213},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Engel84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EnomotoS84,
  author       = {Hikoe Enomoto and
                  Akira Saito},
  title        = {Disjoint shortest paths in graphs},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {275--279},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579137},
  doi          = {10.1007/BF02579137},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/EnomotoS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ErdosFK84,
  author       = {P{\'{e}}ter L. Erd{\"{o}}s and
                  Peter Frankl and
                  Gyula O. H. Katona},
  title        = {Intersecting Sperner families and their convex hulls},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {21--34},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579153},
  doi          = {10.1007/BF02579153},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/ErdosFK84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Fajtlowicz84,
  author       = {Siemion Fajtlowicz},
  title        = {Independence, clique size and maximum degree},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {35--38},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579154},
  doi          = {10.1007/BF02579154},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Fajtlowicz84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Frankl84,
  author       = {Peter Frankl and
                  Vojtech R{\"{o}}dl},
  title        = {Hypergraphs do not jump},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {149--159},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579215},
  doi          = {10.1007/BF02579215},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Frankl84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklP84,
  author       = {Peter Frankl and
                  J{\'{a}}nos Pach},
  title        = {On disjointly representable sets},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {39--45},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579155},
  doi          = {10.1007/BF02579155},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/FranklP84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklR84,
  author       = {Peter Frankl},
  title        = {Families of finite sets with three intersections},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {141--148},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579214},
  doi          = {10.1007/BF02579214},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/FranklR84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Furedi84,
  author       = {Zolt{\'{a}}n F{\"{u}}redi},
  title        = {Hypergraphs in which all disjoint pairs have distinct unions},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {161--168},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579216},
  doi          = {10.1007/BF02579216},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Furedi84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Groflin84,
  author       = {Heinz Gr{\"{o}}flin},
  title        = {Path-closed sets},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {281--290},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579138},
  doi          = {10.1007/BF02579138},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Groflin84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GrotschelLS84,
  author       = {Martin Gr{\"{o}}tschel and
                  L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
                  Alexander Schrijver},
  title        = {Corrigendum to our paper "The ellipsoid method and its consequences
                  in combinatorial optimization"},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {291--295},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579139},
  doi          = {10.1007/BF02579139},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/GrotschelLS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HajnalK84,
  author       = {Andr{\'{a}}s Hajnal and
                  P{\'{e}}ter Komj{\'{a}}th},
  title        = {What must and what need not be contained in a graph of uncountable
                  chromatic number?},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {47--52},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579156},
  doi          = {10.1007/BF02579156},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/HajnalK84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HararyR84,
  author       = {Frank Harary and
                  Robert W. Robinson},
  title        = {Isomorphic factorizations {VIII:} Bisectable trees},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {169--179},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579217},
  doi          = {10.1007/BF02579217},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/HararyR84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Imrich84,
  author       = {Wilfried Imrich},
  title        = {Explicit construction of regular graphs without small cycles},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {53--59},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579157},
  doi          = {10.1007/BF02579157},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Imrich84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KahnS84,
  author       = {Jeff Kahn and
                  Michael E. Saks},
  title        = {A polyomino with no stochastic function},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {181--182},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579218},
  doi          = {10.1007/BF02579218},
  timestamp    = {Mon, 05 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KahnS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KahnSS84,
  author       = {Jeff Kahn and
                  Michael E. Saks and
                  Dean Sturtevant},
  title        = {A topological approach to evasiveness},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {297--306},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579140},
  doi          = {10.1007/BF02579140},
  timestamp    = {Mon, 05 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KahnSS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Karmarkar84,
  author       = {Narendra Karmarkar},
  title        = {A new polynomial-time algorithm for linear programming},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {373--396},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579150},
  doi          = {10.1007/BF02579150},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Karmarkar84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KiersteadST84,
  author       = {Henry A. Kierstead and
                  Endre Szemer{\'{e}}di and
                  William T. Trotter},
  title        = {On coloring graphs with locally small chromatic number},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {183--185},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579219},
  doi          = {10.1007/BF02579219},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KiersteadST84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Kostochka84,
  author       = {Alexandr V. Kostochka},
  title        = {Lower bound of the Hadwiger number of graphs by their average degree},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {307--316},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579141},
  doi          = {10.1007/BF02579141},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Kostochka84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Kriz84,
  author       = {Igor Kr{\'{\i}}z},
  title        = {A class of dimension-skipping graphs},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {317--319},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579142},
  doi          = {10.1007/BF02579142},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Kriz84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Lint84,
  author       = {Jacobus H. van Lint},
  title        = {On equidistant binary codes length n = 4k+1 with distance d = 2k},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {321--323},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579143},
  doi          = {10.1007/BF02579143},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Lint84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/McKayW84,
  author       = {Brendan D. McKay and
                  Nicholas C. Wormald},
  title        = {Automorphisms of random graphs with specified vertices},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {325--338},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579144},
  doi          = {10.1007/BF02579144},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/McKayW84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/MeirM84,
  author       = {Amram Meir and
                  John W. Moon},
  title        = {On random mapping patterns},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {61--70},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579158},
  doi          = {10.1007/BF02579158},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/MeirM84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/NesetrilR84,
  author       = {Jaroslav Nesetril and
                  Vojtech R{\"{o}}dl},
  title        = {Sparse Ramsey graphs},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {71--78},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579159},
  doi          = {10.1007/BF02579159},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/NesetrilR84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Oxley84,
  author       = {James G. Oxley},
  title        = {On the intersections of circuits and cocircuits in matroids},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {187--195},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579220},
  doi          = {10.1007/BF02579220},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Oxley84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ParthasarathyS84,
  author       = {K. R. Parthasarathy and
                  N. Srinivasan},
  title        = {Geodetic blocks of diameter three},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {197--206},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579221},
  doi          = {10.1007/BF02579221},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/ParthasarathyS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/PhelpsR84,
  author       = {Kevin T. Phelps and
                  Vojtech R{\"{o}}dl},
  title        = {On the algorithmic complexity of coloring simple hypergraphs and Steiner
                  triple systems},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {79--88},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579160},
  doi          = {10.1007/BF02579160},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/PhelpsR84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Rimscha84,
  author       = {Michael von Rimscha},
  title        = {The reconstruction problem for certain infinite graphs},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {339--344},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579145},
  doi          = {10.1007/BF02579145},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Rimscha84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Rodl84,
  author       = {Vojtech R{\"{o}}dl},
  title        = {On combinatorial properties of spheres in eulidean spaces},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {345--349},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579146},
  doi          = {10.1007/BF02579146},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Rodl84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Sachs84,
  author       = {Horst Sachs},
  title        = {Perfect matchings in hexagonal systems},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {89--99},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579161},
  doi          = {10.1007/BF02579161},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Sachs84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Seifter84,
  author       = {Norbert Seifter},
  title        = {On automorphisms of infinite graphs with forbidden subgraphs},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {351--356},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579147},
  doi          = {10.1007/BF02579147},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Seifter84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SheeT84,
  author       = {S. C. Shee and
                  H. H. Teh},
  title        = {H-extensions of graphs},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {207--212},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579222},
  doi          = {10.1007/BF02579222},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/SheeT84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SimonovitsS84,
  author       = {Mikl{\'{o}}s Simonovits and
                  Vera T. S{\'{o}}s},
  title        = {On restricted colourings of K\({}_{\mbox{n}}\)},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {101--110},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579162},
  doi          = {10.1007/BF02579162},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/SimonovitsS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/StinsonR84,
  author       = {Douglas R. Stinson and
                  G. H. John van Rees},
  title        = {The equivalence of certain equidistant binary codes and symmetric
                  BIBDs},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {357--362},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579148},
  doi          = {10.1007/BF02579148},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/StinsonR84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Szekely84,
  author       = {L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
  title        = {Measurable chromatic number of geometric graphs and sets without some
                  distnaces in euclidean space},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {213--218},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579223},
  doi          = {10.1007/BF02579223},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Szekely84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Szekely84a,
  author       = {L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
  title        = {On the number of homogeneous subgraphs of a graph},
  journal      = {Comb.},
  volume       = {4},
  number       = {4},
  pages        = {363--372},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579149},
  doi          = {10.1007/BF02579149},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Szekely84a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Tuza84,
  author       = {Zsolt Tuza},
  title        = {Covering of graphs by complete bipartite subgraphs; complexity of
                  0-1 matrices},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {111--116},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579163},
  doi          = {10.1007/BF02579163},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Tuza84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Voigt84,
  author       = {Bernd Voigt},
  title        = {Canonization theorems for finite affine and linear spaces},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {219--239},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579224},
  doi          = {10.1007/BF02579224},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Voigt84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Weiss84,
  author       = {Alfred Weiss},
  title        = {Girth of bipartite sextet graphs},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {241--245},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579225},
  doi          = {10.1007/BF02579225},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Weiss84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/WestTPS84,
  author       = {Douglas B. West and
                  William T. Trotter and
                  G. W. Peck and
                  Peter W. Shor},
  title        = {Regressions and monotone chains: a ramsey - type extermal problem
                  for partial orders},
  journal      = {Comb.},
  volume       = {4},
  number       = {1},
  pages        = {117--119},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579164},
  doi          = {10.1007/BF02579164},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/WestTPS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Wilson84,
  author       = {Richard M. Wilson},
  title        = {The exact bound in the Erd{\"{o}}s - Ko - Rado theorem},
  journal      = {Comb.},
  volume       = {4},
  number       = {2},
  pages        = {247--257},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF02579226},
  doi          = {10.1007/BF02579226},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/Wilson84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics