default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dm/dm42.bht:"
download as .bib file
@article{DBLP:journals/dm/AmahashiK82,
author = {Atsushi Amahashi and
Mikio Kano},
title = {On factors with given components},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {1--6},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90048-6},
doi = {10.1016/0012-365X(82)90048-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AmahashiK82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Barnes82,
author = {Frank W. Barnes},
title = {Algebraic theory of brick packing {I}},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {7--26},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90049-8},
doi = {10.1016/0012-365X(82)90049-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Barnes82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Barnes82a,
author = {Frank W. Barnes},
title = {Algebraic theory of brick packing {II}},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {129--144},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90211-4},
doi = {10.1016/0012-365X(82)90211-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Barnes82a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Beck82,
author = {J{\'{o}}zsef Beck},
title = {On a generalization of Kaplansky's game},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {27--35},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90050-4},
doi = {10.1016/0012-365X(82)90050-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Beck82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Beutelspacher82,
author = {Albrecht Beutelspacher},
title = {On extremal intersection numbers of a block design},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {37--49},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90051-6},
doi = {10.1016/0012-365X(82)90051-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Beutelspacher82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Billington82a,
author = {David Billington},
title = {A simple proof that all 1-designs exist},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {321--322},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90228-X},
doi = {10.1016/0012-365X(82)90228-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Billington82a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BouchetL82,
author = {Andr{\'{e}} Bouchet and
R. Lopez{-}Bracho},
title = {Decomposition of a complete graph into trails of given lengths},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {145--152},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90212-6},
doi = {10.1016/0012-365X(82)90212-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BouchetL82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Cho82,
author = {Chung Je Cho},
title = {Rotational Steiner triple systems},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {153--159},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90213-8},
doi = {10.1016/0012-365X(82)90213-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Cho82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Collatz82,
author = {Lothar Collatz},
title = {Equipartition with square numbers},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {313--316},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90226-6},
doi = {10.1016/0012-365X(82)90226-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Collatz82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Delandtsheer82,
author = {Anne Delandtsheer},
title = {Finite planar spaces with isomorphic planes},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {161--176},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90214-X},
doi = {10.1016/0012-365X(82)90214-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Delandtsheer82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Dhurandhar82,
author = {Medha Dhurandhar},
title = {Improvement on Brooks' chromatic bound for a class of graphs},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {51--56},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90052-8},
doi = {10.1016/0012-365X(82)90052-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Dhurandhar82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosHP82,
author = {Paul Erd{\"{o}}s and
Arthur M. Hobbs and
C. Payan},
title = {Disjoint cliques and disjoint maximal independent sets of vertices
in graphs},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {57--61},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90053-X},
doi = {10.1016/0012-365X(82)90053-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ErdosHP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Favaron82,
author = {Odile Favaron},
title = {Very well covered graphs},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {177--187},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90215-1},
doi = {10.1016/0012-365X(82)90215-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Favaron82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GouldJ82,
author = {Ronald J. Gould and
Michael S. Jacobson},
title = {Forbidden subgraphs and Hamiltonian properties of graphs},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {189--196},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90216-3},
doi = {10.1016/0012-365X(82)90216-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GouldJ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GuerraU82,
author = {L. Guerra and
Emanuela Ughi},
title = {On the distribution of legendre symbols in galois fields},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {197--208},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90217-5},
doi = {10.1016/0012-365X(82)90217-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GuerraU82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HobbsS82,
author = {Arthur M. Hobbs and
Edward F. Schmeichel},
title = {On the maximum number of independent edges in cubic graphs},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {317--320},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90227-8},
doi = {10.1016/0012-365X(82)90227-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HobbsS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jacobson82a,
author = {Michael S. Jacobson},
title = {On the Ramsey multiplicity for stars},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {63--66},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90054-1},
doi = {10.1016/0012-365X(82)90054-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Jacobson82a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KatchalskiL82,
author = {Meir Katchalski and
Ted Lewis},
title = {Cutting rectangles in the plane},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {67--71},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90055-3},
doi = {10.1016/0012-365X(82)90055-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KatchalskiL82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Keating82,
author = {Kevin Keating},
title = {The conjunction of Cayley digraphs},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {209--219},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90218-7},
doi = {10.1016/0012-365X(82)90218-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Keating82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Koutras82,
author = {Markos V. Koutras},
title = {Non-central stirling numbers and some applications},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {73--89},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90056-5},
doi = {10.1016/0012-365X(82)90056-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Koutras82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Machi82,
author = {A. Mach{\`{\i}}},
title = {On the complexity of a hypermap},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {221--226},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90219-9},
doi = {10.1016/0012-365X(82)90219-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Machi82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MaruicP82,
author = {Dragan Marusic and
Torrence D. Parsons},
title = {Hamiltonian paths in vertex-symmetric graphs of order 5p},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {227--242},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90220-5},
doi = {10.1016/0012-365X(82)90220-5},
timestamp = {Fri, 15 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/MaruicP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Moon82a,
author = {Aeryung Moon},
title = {Characterization of the odd graphs O\({}_{\mbox{k}}\) by parameters},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {91--97},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90057-7},
doi = {10.1016/0012-365X(82)90057-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Moon82a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Narushima82,
author = {Hiroshi Narushima},
title = {Principle of inclusion-exclusion on partially ordered sets},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {243--250},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90221-7},
doi = {10.1016/0012-365X(82)90221-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Narushima82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Newhart82,
author = {Donald W. Newhart},
title = {Information sets in quadratic-residue codes},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {251--266},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90222-9},
doi = {10.1016/0012-365X(82)90222-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Newhart82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Peele82,
author = {Rhodes Peele},
title = {On finite partition representations of lattices},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {267--280},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90223-0},
doi = {10.1016/0012-365X(82)90223-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Peele82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PoljakT82,
author = {Svatopluk Poljak and
Daniel Turz{\'{\i}}k},
title = {A note on sticky matroids},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {119--123},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90060-7},
doi = {10.1016/0012-365X(82)90060-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/PoljakT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Preissmann82,
author = {Myriam Preissmann},
title = {Snarks of order 18},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {125--126},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90061-9},
doi = {10.1016/0012-365X(82)90061-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Preissmann82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ReadR82,
author = {Ronald C. Read and
Robert W. Robinson},
title = {Enumeration of labelled multigraphs by degree parities},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {99--105},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90058-9},
doi = {10.1016/0012-365X(82)90058-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ReadR82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Savage82,
author = {Carla D. Savage},
title = {Short strings containing all k-element permutations},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {281--285},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90224-2},
doi = {10.1016/0012-365X(82)90224-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Savage82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Varecza82,
author = {{\'{A}}. Varecza},
title = {Are two given elements neighbouring?},
journal = {Discret. Math.},
volume = {42},
number = {1},
pages = {107--117},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90059-0},
doi = {10.1016/0012-365X(82)90059-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Varecza82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Zaslavsky82a,
author = {Thomas Zaslavsky},
title = {Chromatic invariants of signed graphs},
journal = {Discret. Math.},
volume = {42},
number = {2-3},
pages = {287--312},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90225-4},
doi = {10.1016/0012-365X(82)90225-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Zaslavsky82a.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-26 21:58 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:
