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/dm/dm49.bht:"
download as .bib file
@article{DBLP:journals/dm/AhlswedeGP84,
author = {Rudolf Ahlswede and
Abbas El Gamal and
King F. Pang},
title = {A two-family extremal problem in hamming space},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {1--5},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90144-4},
doi = {10.1016/0012-365X(84)90144-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AhlswedeGP84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AllanLH84,
author = {Robert B. Allan and
Renu C. Laskar and
Stephen T. Hedetniemi},
title = {A note on total domination},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {7--13},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90145-6},
doi = {10.1016/0012-365X(84)90145-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AllanLH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Alon84,
author = {Noga Alon},
title = {A note on subdigraphs of digraphs with large outdegrees},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {321--322},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90172-9},
doi = {10.1016/0012-365X(84)90172-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Alon84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Alspach84,
author = {Brian Alspach},
title = {Research problems},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {219},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90123-7},
doi = {10.1016/0012-365X(84)90123-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Alspach84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AndrewsB84,
author = {George E. Andrews and
David M. Bressoud},
title = {Identities in combinatorics {III:} Further aspects of ordered set
sorting},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {223--236},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90159-6},
doi = {10.1016/0012-365X(84)90159-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AndrewsB84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AravamudhanR84,
author = {R. Aravamudhan and
B. Rajendran},
title = {On antipodal graphs},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {193--195},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90117-1},
doi = {10.1016/0012-365X(84)90117-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AravamudhanR84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Barefoot84,
author = {Curtis A. Barefoot},
title = {Interpolation theorem for the number of pendant vertices of connected
spanning subgraphs of equal size},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {109--112},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90061-X},
doi = {10.1016/0012-365X(84)90061-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Barefoot84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Batten84a,
author = {Lynn Margaret Batten},
title = {Rank functions of closure spaces of finite rank},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {113--116},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90062-1},
doi = {10.1016/0012-365X(84)90062-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Batten84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Beznea84,
author = {Lucian Beznea},
title = {A topological characterization of complete distributive lattices},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {117--120},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90063-3},
doi = {10.1016/0012-365X(84)90063-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Beznea84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BollobasC84,
author = {B{\'{e}}la Bollob{\'{a}}s and
Ernest J. Cockayne},
title = {The irredundance number and maximum degree of a graph},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {197--199},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90118-3},
doi = {10.1016/0012-365X(84)90118-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BollobasC84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BookS84,
author = {Ronald V. Book and
Craig C. Squier},
title = {Almost all one-rule thue systems have decidable word problems},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {237--240},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90160-2},
doi = {10.1016/0012-365X(84)90160-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BookS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Broder84,
author = {Andrei Z. Broder},
title = {The r-Stirling numbers},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {241--259},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90161-4},
doi = {10.1016/0012-365X(84)90161-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Broder84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Brouwer84,
author = {Andries E. Brouwer},
title = {Distance regular graphs of diameter 3 and strongly regular graphs},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {101--103},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90157-2},
doi = {10.1016/0012-365X(84)90157-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Brouwer84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Cai84,
author = {Mao{-}cheng Cai},
title = {On separating systems of graphs},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {15--20},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90146-8},
doi = {10.1016/0012-365X(84)90146-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Cai84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChenKL84,
author = {C. C. Chen and
Khee Meng Koh and
S. C. Lee},
title = {On the grading numbers of direct products of chains},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {21--26},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90147-X},
doi = {10.1016/0012-365X(84)90147-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChenKL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Csima84,
author = {J. Csima},
title = {Colouring finite planes of odd order},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {309},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90168-7},
doi = {10.1016/0012-365X(84)90168-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Csima84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DelormeH84,
author = {Charles Delorme and
Gena Hahn},
title = {Infinite generalized friendship graphs},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {261--266},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90162-6},
doi = {10.1016/0012-365X(84)90162-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DelormeH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Foregger84,
author = {Marsha F. Foregger},
title = {The skew chromatic index of a graph},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {27--39},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90148-1},
doi = {10.1016/0012-365X(84)90148-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Foregger84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GarocheL84,
author = {Fran{\c{c}}oise Reynaud Garoche and
Michel L{\'{e}}onard},
title = {On a class of boolean functions with matroid property},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {323--325},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90173-0},
doi = {10.1016/0012-365X(84)90173-0},
timestamp = {Fri, 25 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GarocheL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Gessel84,
author = {Ira M. Gessel},
title = {Some generalized Durfee square identities},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {41--44},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90149-3},
doi = {10.1016/0012-365X(84)90149-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Gessel84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HellK84,
author = {Pavol Hell and
David G. Kirkpatrick},
title = {Packings by cliques and by finite families of graphs},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {45--59},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90150-X},
doi = {10.1016/0012-365X(84)90150-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HellK84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Hendry84,
author = {George R. T. Hendry},
title = {Graphs uniquely hamiltonian-connected from a vertex},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {61--74},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90151-1},
doi = {10.1016/0012-365X(84)90151-1},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Hendry84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Iorgulescu84a,
author = {Afrodita Iorgulescu},
title = {Functors between categories of three-valued Lukasiewicz-Moisil algebras
{I}},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {121--131},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90109-2},
doi = {10.1016/0012-365X(84)90109-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Iorgulescu84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Keedwell84,
author = {A. Donald Keedwell},
title = {More super p-groups},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {205--207},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90120-1},
doi = {10.1016/0012-365X(84)90120-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Keedwell84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kung84,
author = {Joseph P. S. Kung},
title = {Jacobi's identity and the K{\"{o}}nig-Egerv{\'{a}}ry theorem},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {75--77},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90152-3},
doi = {10.1016/0012-365X(84)90152-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kung84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lassmann84,
author = {Gunter Lassmann},
title = {On 4-isomorphisms of graphs},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {79--81},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90153-5},
doi = {10.1016/0012-365X(84)90153-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lassmann84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Maehara84,
author = {Hiroshi Maehara},
title = {On the sphericity for the join of many graphs},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {311--313},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90169-9},
doi = {10.1016/0012-365X(84)90169-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Maehara84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Mazzocca84,
author = {Francesco Mazzocca},
title = {On a class of lattices associated with n-cubes},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {133--138},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90110-9},
doi = {10.1016/0012-365X(84)90110-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Mazzocca84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Mercier84,
author = {Armel Mercier},
title = {Quelques identit{\'{e}}s de l'analyse combinatoire},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {139--149},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90111-0},
doi = {10.1016/0012-365X(84)90111-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Mercier84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Mollard84,
author = {Michel Mollard},
title = {Une nouvelle famille de 3-codes parfaits sur GF(q)},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {209--212},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90121-3},
doi = {10.1016/0012-365X(84)90121-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Mollard84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Neumann-LaraU84,
author = {Victor Neumann{-}Lara and
Jorge Urrutia},
title = {Vertex critical r-dichromatic tournaments},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {83--87},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90154-7},
doi = {10.1016/0012-365X(84)90154-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Neumann-LaraU84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ParthasarathyS84,
author = {K. R. Parthasarathy and
N. Srinivasan},
title = {An extremal problem in geodetic graphs},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {151--159},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90112-2},
doi = {10.1016/0012-365X(84)90112-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ParthasarathyS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PayanTX84,
author = {Charles Payan and
Maurice Tchuent{\'{e}} and
Nguyen Huy Xuong},
title = {Arbres avec un nombre maximum de sommets pendants},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {267--273},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90163-8},
doi = {10.1016/0012-365X(84)90163-8},
timestamp = {Wed, 25 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/PayanTX84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Peck84,
author = {G. W. Peck},
title = {A new proof of a theorem of Graham and Pollak},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {327--328},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90174-2},
doi = {10.1016/0012-365X(84)90174-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Peck84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Plesnik84,
author = {J{\'{a}}n Plesn{\'{\i}}k},
title = {A note on the complexity of finding regular subgraphs},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {161--167},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90113-4},
doi = {10.1016/0012-365X(84)90113-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Plesnik84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Plesnik84a,
author = {J{\'{a}}n Plesn{\'{\i}}k},
title = {Equivalence between the minimum covering problem and the maximum matching
problem},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {315--317},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90170-5},
doi = {10.1016/0012-365X(84)90170-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Plesnik84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Proskurowski84,
author = {Andrzej Proskurowski},
title = {Separating subgraphs in k-trees: Cables and caterpillars},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {275--285},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90164-X},
doi = {10.1016/0012-365X(84)90164-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Proskurowski84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Rucinski84,
author = {Andrzej Rucinski},
title = {The behaviour of (k, ..., k\({}^{\mbox{n}}\), n-ik)c\({}^{\mbox{i/i}}\)!
is asymptotically normal},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {287--290},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90165-1},
doi = {10.1016/0012-365X(84)90165-1},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Rucinski84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Ryser84,
author = {H. J. Ryser},
title = {Matrices and set differences},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {169--173},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90114-6},
doi = {10.1016/0012-365X(84)90114-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Ryser84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Sharma84,
author = {Aruna Sharma},
title = {A note on stability of graphs},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {201--203},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90119-5},
doi = {10.1016/0012-365X(84)90119-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Sharma84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Simion84,
author = {Rodica Simion},
title = {The lattice automorphisms of the dominance ordering},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {89--93},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90155-9},
doi = {10.1016/0012-365X(84)90155-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Simion84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Staton84,
author = {William Staton},
title = {Induced forests in cubic graphs},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {175--178},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90115-8},
doi = {10.1016/0012-365X(84)90115-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Staton84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Strong84,
author = {R. E. Strong},
title = {Group actions on finite spaces},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {95--100},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90156-0},
doi = {10.1016/0012-365X(84)90156-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Strong84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tamari84,
author = {Fumikazu Tamari},
title = {On linear codes which attain the Solomon-Stiffler bound},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {179--191},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90116-X},
doi = {10.1016/0012-365X(84)90116-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tamari84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tonchev84,
author = {Vladimir D. Tonchev},
title = {The isomorphism of the Cohen, Haemers-van Lint and De Clerck-Dye-Thas
partial geometries},
journal = {Discret. Math.},
volume = {49},
number = {2},
pages = {213--217},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90122-5},
doi = {10.1016/0012-365X(84)90122-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tonchev84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuma84,
author = {Jir{\'{\i}} Tuma},
title = {Note on binary simplicial matroids},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {105--107},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90158-4},
doi = {10.1016/0012-365X(84)90158-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuma84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Turan84,
author = {Gy{\"{o}}rgy Tur{\'{a}}n},
title = {On the definability of properties of finite graphs},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {291--302},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90166-3},
doi = {10.1016/0012-365X(84)90166-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Turan84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wills84,
author = {J{\"{o}}rg M. Wills},
title = {Finite platonic graphs},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {303--308},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90167-5},
doi = {10.1016/0012-365X(84)90167-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wills84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Zeilberger84b,
author = {Doron Zeilberger},
title = {A combinatorial proof of Newton's identities},
journal = {Discret. Math.},
volume = {49},
number = {3},
pages = {319},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90171-7},
doi = {10.1016/0012-365X(84)90171-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Zeilberger84b.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-04 08:22 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:
