default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dm/dm63.bht:"
download as .bib file
@article{DBLP:journals/dm/AignerW87,
author = {Martin Aigner and
Rudolf Wille},
title = {Preface},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {115},
year = {1987},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AignerW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CanfieldW87,
author = {E. Rodney Canfield and
Nicholas C. Wormald},
title = {M{\'{e}}nage numbers, bijections and P-recursiveness},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {117--129},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90002-1},
doi = {10.1016/0012-365X(87)90002-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CanfieldW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Clements87,
author = {G. F. Clements},
title = {An extremal problem for antichains of subsets of a multiset},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {1--14},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90146-4},
doi = {10.1016/0012-365X(87)90146-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Clements87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CollinsSS87,
author = {Karen L. Collins and
Peter W. Shor and
John R. Stembridge},
title = {A lower bound for 0, 1, * tournament codes},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {15--19},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90147-6},
doi = {10.1016/0012-365X(87)90147-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CollinsSS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Davies87,
author = {Huw Davies},
title = {Flag-transitivity and primitivity},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {91--93},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90154-3},
doi = {10.1016/0012-365X(87)90154-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Davies87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Evans87,
author = {Anthony B. Evans},
title = {Generating orthomorphisms of GF(q)\({}^{\mbox{+}}\)},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {21--26},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90148-8},
doi = {10.1016/0012-365X(87)90148-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Evans87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FaigleT87,
author = {Ulrich Faigle and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {On the complexity of interval orders and semiorders},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {131--141},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90003-3},
doi = {10.1016/0012-365X(87)90003-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FaigleT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklM87,
author = {Peter Frankl and
Hiroshi Maehara},
title = {Open-interval graphs versus closed-interval graphs},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {97--100},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90156-7},
doi = {10.1016/0012-365X(87)90156-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FurediGOS87,
author = {Zolt{\'{a}}n F{\"{u}}redi and
Jerrold R. Griggs and
Andrew M. Odlyzko and
James B. Shearer},
title = {Ramsey-Sperner theory},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {143--152},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90004-5},
doi = {10.1016/0012-365X(87)90004-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FurediGOS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GanterHP87,
author = {Bernhard Ganter and
Gerhart H{\"{a}}fner and
Werner Poguntke},
title = {On linear extensions of ordered sets with a symmetry},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {153--156},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90005-7},
doi = {10.1016/0012-365X(87)90005-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GanterHP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HabibM87,
author = {Michel Habib and
Rolf H. M{\"{o}}hring},
title = {On some complexity properties of N-free posets and posets with bounded
decomposition diameter},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {157--182},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90006-9},
doi = {10.1016/0012-365X(87)90006-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HabibM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jepsen87,
author = {Charles H. Jepsen},
title = {On colorings of finite projective planes},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {95--96},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90155-5},
doi = {10.1016/0012-365X(87)90155-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Jepsen87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KahnS87,
author = {Jeff Kahn and
Michael E. Saks},
title = {On the widths of finite distributive lattices},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {183--195},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90007-0},
doi = {10.1016/0012-365X(87)90007-0},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/KahnS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kelly87,
author = {David Kelly},
title = {Fundamentals of planar ordered sets},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {197--216},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90008-2},
doi = {10.1016/0012-365X(87)90008-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kelly87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KiersteadT87,
author = {Hal A. Kierstead and
William T. Trotter},
title = {A Ramsey theoretic problem for finite ordered sets},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {217--223},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90009-4},
doi = {10.1016/0012-365X(87)90009-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KiersteadT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LawsonMP87,
author = {Jimmie D. Lawson and
Michael W. Mislove and
Hilary A. Priestley},
title = {Ordered sets with no infinite antichains},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {225--230},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90010-0},
doi = {10.1016/0012-365X(87)90010-0},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LawsonMP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Moon87,
author = {John W. Moon},
title = {The number of trees with a 1-factor},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {27--37},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90149-X},
doi = {10.1016/0012-365X(87)90149-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Moon87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Nowakowski87,
author = {Richard J. Nowakowski},
title = {Cutsets of Boolean lattices},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {231--240},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90011-2},
doi = {10.1016/0012-365X(87)90011-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Nowakowski87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Owens87,
author = {P. J. Owens},
title = {Knight's move squares},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {39--51},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90150-6},
doi = {10.1016/0012-365X(87)90150-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Owens87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Pretzel87,
author = {Oliver Pretzel},
title = {A non-covering graph of girth six},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {241--244},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90012-4},
doi = {10.1016/0012-365X(87)90012-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Pretzel87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Reuter87,
author = {Klaus Reuter},
title = {Matchings for linearly indecomposable modular lattices},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {245--247},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90013-6},
doi = {10.1016/0012-365X(87)90013-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Reuter87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RivalZ87,
author = {Ivan Rival and
Nejib Zaguia},
title = {Greedy linear extensions with constraints},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {249--260},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90014-8},
doi = {10.1016/0012-365X(87)90014-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RivalZ87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Rosenberg87,
author = {Ivo G. Rosenberg},
title = {Characterization of diagrams by 0-1 inequalities},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {261--270},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90015-X},
doi = {10.1016/0012-365X(87)90015-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Rosenberg87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Scheinerman87,
author = {Edward R. Scheinerman},
title = {Irredundancy in multiple interval representations},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {101--108},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90157-9},
doi = {10.1016/0012-365X(87)90157-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Scheinerman87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ShaK87,
author = {Jichang Sha and
Daniel J. Kleitman},
title = {The number of linear extensions of subset ordering},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {271--278},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90016-1},
doi = {10.1016/0012-365X(87)90016-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ShaK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Simpson87,
author = {James E. Simpson},
title = {A note on perfect systems of difference sets},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {109--110},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90158-0},
doi = {10.1016/0012-365X(87)90158-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Simpson87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SoneokaNIP87,
author = {Terunao Soneoka and
Hiroshi Nakada and
Makoto Imase and
Claudine Peyrat},
title = {Sufficient conditions for maximally connected dense graphs},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {53--66},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90151-8},
doi = {10.1016/0012-365X(87)90151-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SoneokaNIP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SteinE87,
author = {P. R. Stein and
C. J. Everett},
title = {On the iteration of a bijective transformation of integer k-tuples},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {67--79},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90152-X},
doi = {10.1016/0012-365X(87)90152-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/SteinE87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Syslo87,
author = {Maciej M. Syslo},
title = {Minimizing the jump number for partially-ordered sets: a graph-theoretic
approach, {II}},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {279--295},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90017-3},
doi = {10.1016/0012-365X(87)90017-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Syslo87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/West87,
author = {Douglas B. West},
title = {Unichain coverings in partial orders with the nested saturation property},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {297--303},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90018-5},
doi = {10.1016/0012-365X(87)90018-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/West87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wild87,
author = {Peter R. Wild},
title = {Difference basis systems},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {81--90},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90153-1},
doi = {10.1016/0012-365X(87)90153-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wild87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wille87,
author = {Rudolf Wille},
title = {Subdirect product construction of concept lattices},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {305--313},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90019-7},
doi = {10.1016/0012-365X(87)90019-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wille87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-09-21 04:52 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:
