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/combinatorica/combinatorica5.bht:"
download as .bib file
@article{DBLP:journals/combinatorica/Aharoni85,
author = {Ron Aharoni},
title = {Fractional matchings and covers in infinite hypergraphs},
journal = {Comb.},
volume = {5},
number = {3},
pages = {181--184},
year = {1985},
url = {https://doi.org/10.1007/BF02579360},
doi = {10.1007/BF02579360},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Aharoni85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BierbrauerB85,
author = {J{\"{u}}rgen Bierbrauer and
Albrecht Brandis},
title = {On generalized Ramsey numbers for trees},
journal = {Comb.},
volume = {5},
number = {2},
pages = {95--107},
year = {1985},
url = {https://doi.org/10.1007/BF02579372},
doi = {10.1007/BF02579372},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BierbrauerB85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Cunningham85,
author = {William H. Cunningham},
title = {On submodular function minimization},
journal = {Comb.},
volume = {5},
number = {3},
pages = {185--192},
year = {1985},
url = {https://doi.org/10.1007/BF02579361},
doi = {10.1007/BF02579361},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Cunningham85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Dawson85,
author = {Jeremy E. Dawson},
title = {Decomposition of binary matroids},
journal = {Comb.},
volume = {5},
number = {1},
pages = {1--9},
year = {1985},
url = {https://doi.org/10.1007/BF02579437},
doi = {10.1007/BF02579437},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Dawson85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DeckerGH85,
author = {Richard William Decker and
Henry H. Glover and
John Philip Huneke},
title = {Computing the genus of the 2-amalgamations of graphs},
journal = {Comb.},
volume = {5},
number = {4},
pages = {271--282},
year = {1985},
url = {https://doi.org/10.1007/BF02579241},
doi = {10.1007/BF02579241},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/DeckerGH85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Deimer85,
author = {Knut Deimer},
title = {A new upper bound for the length of snakes},
journal = {Comb.},
volume = {5},
number = {2},
pages = {109--120},
year = {1985},
url = {https://doi.org/10.1007/BF02579373},
doi = {10.1007/BF02579373},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Deimer85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DiestelHV85,
author = {Reinhard Diestel and
Rudolf Halin and
Walter Vogler},
title = {Some remarks on universal graphs},
journal = {Comb.},
volume = {5},
number = {4},
pages = {283--293},
year = {1985},
url = {https://doi.org/10.1007/BF02579242},
doi = {10.1007/BF02579242},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/DiestelHV85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/El-ZaharE85,
author = {Mohamed M. El{-}Zahar and
Paul Erd{\"{o}}s},
title = {On the existence of two non-neighboring subgraphs in a graph},
journal = {Comb.},
volume = {5},
number = {4},
pages = {295--300},
year = {1985},
url = {https://doi.org/10.1007/BF02579243},
doi = {10.1007/BF02579243},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/El-ZaharE85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/El-ZaharS85,
author = {Mohamed M. El{-}Zahar and
Norbert Sauer},
title = {The chromatic number of the product of two 4-chromatic graphs is 4},
journal = {Comb.},
volume = {5},
number = {2},
pages = {121--126},
year = {1985},
url = {https://doi.org/10.1007/BF02579374},
doi = {10.1007/BF02579374},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/El-ZaharS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EngelK85,
author = {Konrad Engel and
Nikolai N. Kuzjurin},
title = {About the ratio of the size of a maximum antichain to the size of
a maximum level in finite partially ordered sets},
journal = {Comb.},
volume = {5},
number = {4},
pages = {301--309},
year = {1985},
url = {https://doi.org/10.1007/BF02579244},
doi = {10.1007/BF02579244},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EngelK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ErdosFK85,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Peter Frankl and
Gyula O. H. Katona},
title = {Extremal hypergraph problems and convex hulls},
journal = {Comb.},
volume = {5},
number = {1},
pages = {11--26},
year = {1985},
url = {https://doi.org/10.1007/BF02579438},
doi = {10.1007/BF02579438},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ErdosFK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ErdosFRS85,
author = {Paul Erd{\"{o}}s and
Ralph J. Faudree and
Cecil C. Rousseau and
Richard H. Schelp},
title = {Multipartite graph - space graph Ramsey numbers},
journal = {Comb.},
volume = {5},
number = {4},
pages = {311--318},
year = {1985},
url = {https://doi.org/10.1007/BF02579245},
doi = {10.1007/BF02579245},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ErdosFRS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FraysseixR85,
author = {Hubert de Fraysseix and
Pierre Rosenstiehl},
title = {A characterization of planar graphs by Tr{\'{e}}maux orders},
journal = {Comb.},
volume = {5},
number = {2},
pages = {127--135},
year = {1985},
url = {https://doi.org/10.1007/BF02579375},
doi = {10.1007/BF02579375},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FraysseixR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Furedi85,
author = {Zolt{\'{a}}n F{\"{u}}redi},
title = {Set-systems with three intersections},
journal = {Comb.},
volume = {5},
number = {1},
pages = {27--31},
year = {1985},
url = {https://doi.org/10.1007/BF02579439},
doi = {10.1007/BF02579439},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Furedi85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Godsil85,
author = {Chris D. Godsil},
title = {Inverses of trees},
journal = {Comb.},
volume = {5},
number = {1},
pages = {33--39},
year = {1985},
url = {https://doi.org/10.1007/BF02579440},
doi = {10.1007/BF02579440},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Godsil85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GyarfasLT85,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Jen{\"{o}} Lehel and
Zsolt Tuza},
title = {How many atoms can be defined by boxes},
journal = {Comb.},
volume = {5},
number = {3},
pages = {193--204},
year = {1985},
url = {https://doi.org/10.1007/BF02579362},
doi = {10.1007/BF02579362},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GyarfasLT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GyarfasPSV85,
author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
Hans J{\"{u}}rgen Pr{\"{o}}mel and
Endre Szemer{\'{e}}di and
Bernd Voigt},
title = {On the sum of the reciprocals of cycle lengths in sparse graphs},
journal = {Comb.},
volume = {5},
number = {1},
pages = {41--52},
year = {1985},
url = {https://doi.org/10.1007/BF02579441},
doi = {10.1007/BF02579441},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GyarfasPSV85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Gyori85,
author = {Ervin Gy{\"{o}}ri},
title = {Covering simply connected regions by rectangles},
journal = {Comb.},
volume = {5},
number = {1},
pages = {53--55},
year = {1985},
url = {https://doi.org/10.1007/BF02579442},
doi = {10.1007/BF02579442},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Gyori85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HajelaS85,
author = {D. J. Hajela and
Paul D. Seymour},
title = {Counting points in hypercubes and convolution measure algebras},
journal = {Comb.},
volume = {5},
number = {3},
pages = {205--214},
year = {1985},
url = {https://doi.org/10.1007/BF02579363},
doi = {10.1007/BF02579363},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HajelaS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Hajnal85,
author = {Andr{\'{a}}s Hajnal},
title = {The chromatic number of the product of two Alef \({}_{\mbox{i}}\)
- Chromatic Graphs can be countable},
journal = {Comb.},
volume = {5},
number = {2},
pages = {137--139},
year = {1985},
url = {https://doi.org/10.1007/BF02579376},
doi = {10.1007/BF02579376},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Hajnal85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HammerMW85,
author = {Peter L. Hammer and
Nadimpalli V. R. Mahadev and
Dominique de Werra},
title = {The struction of a graph: Application to CN-free graphs},
journal = {Comb.},
volume = {5},
number = {2},
pages = {141--147},
year = {1985},
url = {https://doi.org/10.1007/BF02579377},
doi = {10.1007/BF02579377},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HammerMW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Hausner85,
author = {Melvin Hausner},
title = {Inclusion-exclusion inequalities},
journal = {Comb.},
volume = {5},
number = {3},
pages = {215--225},
year = {1985},
url = {https://doi.org/10.1007/BF02579364},
doi = {10.1007/BF02579364},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Hausner85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Kahn85,
author = {Jeff Kahn},
title = {A problem of P. Seymour on nonbinary matroids},
journal = {Comb.},
volume = {5},
number = {4},
pages = {319--323},
year = {1985},
url = {https://doi.org/10.1007/BF02579246},
doi = {10.1007/BF02579246},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Kahn85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Karzanov85,
author = {Alexander V. Karzanov},
title = {Families of cuts with the MFMC-property},
journal = {Comb.},
volume = {5},
number = {4},
pages = {325--336},
year = {1985},
url = {https://doi.org/10.1007/BF02579247},
doi = {10.1007/BF02579247},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Karzanov85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Koester85,
author = {G. Koester},
title = {Note to a problem of T. Gallai and G. A. Dirac},
journal = {Comb.},
volume = {5},
number = {3},
pages = {227--228},
year = {1985},
url = {https://doi.org/10.1007/BF02579365},
doi = {10.1007/BF02579365},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Koester85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Komlos85,
author = {J{\'{a}}nos Koml{\'{o}}s},
title = {Linear verification for spanning trees},
journal = {Comb.},
volume = {5},
number = {1},
pages = {57--65},
year = {1985},
url = {https://doi.org/10.1007/BF02579443},
doi = {10.1007/BF02579443},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Komlos85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Kostochka85,
author = {Alexandr V. Kostochka},
title = {Maximum set of edges no two covered by a clique},
journal = {Comb.},
volume = {5},
number = {3},
pages = {229--236},
year = {1985},
url = {https://doi.org/10.1007/BF02579366},
doi = {10.1007/BF02579366},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Kostochka85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/LandauLS85,
author = {Henry J. Landau and
Benjamin F. Logan and
Larry A. Shepp},
title = {An inequality conjectured by Hajela and Seymour arising in combinatorial
geometry},
journal = {Comb.},
volume = {5},
number = {4},
pages = {337--342},
year = {1985},
url = {https://doi.org/10.1007/BF02579248},
doi = {10.1007/BF02579248},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/LandauLS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Lindstrom85,
author = {Bernt Lindstr{\"{o}}m},
title = {A Desagruesian theorem for algebraic combinatorial geometries},
journal = {Comb.},
volume = {5},
number = {3},
pages = {237--239},
year = {1985},
url = {https://doi.org/10.1007/BF02579367},
doi = {10.1007/BF02579367},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Lindstrom85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Locke85,
author = {Stephen C. Locke},
title = {A generalization of Dirac's theorem},
journal = {Comb.},
volume = {5},
number = {2},
pages = {149--159},
year = {1985},
url = {https://doi.org/10.1007/BF02579378},
doi = {10.1007/BF02579378},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/Locke85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Mader85,
author = {Wolfgang Mader},
title = {Degree and local connectivity in digraphs},
journal = {Comb.},
volume = {5},
number = {2},
pages = {161--165},
year = {1985},
url = {https://doi.org/10.1007/BF02579379},
doi = {10.1007/BF02579379},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Mader85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Oxley85,
author = {James G. Oxley},
title = {Proof of a conjecture of Kahn for non-binary matroids},
journal = {Comb.},
volume = {5},
number = {4},
pages = {343--345},
year = {1985},
url = {https://doi.org/10.1007/BF02579249},
doi = {10.1007/BF02579249},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Oxley85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Pyber85,
author = {L{\'{a}}szl{\'{o}} Pyber},
title = {An Erd{\"{o}}s - Gallai conjecture},
journal = {Comb.},
volume = {5},
number = {1},
pages = {67--79},
year = {1985},
url = {https://doi.org/10.1007/BF02579444},
doi = {10.1007/BF02579444},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Pyber85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Pyber85a,
author = {L{\'{a}}szl{\'{o}} Pyber},
title = {Regular subgraphs of dense graphs},
journal = {Comb.},
volume = {5},
number = {4},
pages = {347--349},
year = {1985},
url = {https://doi.org/10.1007/BF02579250},
doi = {10.1007/BF02579250},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Pyber85a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/RothschildS85,
author = {B. L. Rothschild and
Ernst G. Straus},
title = {On triangulations of the convex hull of n points},
journal = {Comb.},
volume = {5},
number = {2},
pages = {167--179},
year = {1985},
url = {https://doi.org/10.1007/BF02579380},
doi = {10.1007/BF02579380},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/RothschildS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SchmidtS85,
author = {Jeanette P. Schmidt and
Eli Shamir},
title = {Component structure in the evolution of random hypergraphs},
journal = {Comb.},
volume = {5},
number = {1},
pages = {81--94},
year = {1985},
url = {https://doi.org/10.1007/BF02579445},
doi = {10.1007/BF02579445},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/SchmidtS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Shearer85,
author = {James B. Shearer},
title = {On a problem of spencer},
journal = {Comb.},
volume = {5},
number = {3},
pages = {241--245},
year = {1985},
url = {https://doi.org/10.1007/BF02579368},
doi = {10.1007/BF02579368},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Shearer85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ShrikhandeS85,
author = {S. S. Shrikhande and
N. M. Singhi},
title = {On a problem of Erd{\"{o}}s and Larson},
journal = {Comb.},
volume = {5},
number = {4},
pages = {351--358},
year = {1985},
url = {https://doi.org/10.1007/BF02579251},
doi = {10.1007/BF02579251},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ShrikhandeS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Steffens85,
author = {Karsten Steffens},
title = {Maximal tight sets and the Edmonds - Gallai decomposition for matchings},
journal = {Comb.},
volume = {5},
number = {4},
pages = {359--365},
year = {1985},
url = {https://doi.org/10.1007/BF02579252},
doi = {10.1007/BF02579252},
timestamp = {Thu, 30 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/Steffens85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Tardos85,
author = {{\'{E}}va Tardos},
title = {A strongly polynomial minimum cost circulation algorithm},
journal = {Comb.},
volume = {5},
number = {3},
pages = {247--256},
year = {1985},
url = {https://doi.org/10.1007/BF02579369},
doi = {10.1007/BF02579369},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Tardos85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Tarjan85,
author = {Robert Endre Tarjan},
title = {Sequential access in play trees takes linear time},
journal = {Comb.},
volume = {5},
number = {4},
pages = {367--378},
year = {1985},
url = {https://doi.org/10.1007/BF02579253},
doi = {10.1007/BF02579253},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Tarjan85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/VinceW85,
author = {Andrew Vince and
Michelle L. Wachs},
title = {A shellable poset that is not lexicographically shellable},
journal = {Comb.},
volume = {5},
number = {3},
pages = {257--260},
year = {1985},
url = {https://doi.org/10.1007/BF02579370},
doi = {10.1007/BF02579370},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/VinceW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Voss85,
author = {Heinz{-}J{\"{u}}rgen Voss},
title = {Independent sets in k-chromatic graphs},
journal = {Comb.},
volume = {5},
number = {3},
pages = {261--269},
year = {1985},
url = {https://doi.org/10.1007/BF02579371},
doi = {10.1007/BF02579371},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Voss85.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-05-07 09:14 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:
