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/dm38.bht:"
download as .bib file
@article{DBLP:journals/dm/AsanoSEH82,
author = {Takao Asano and
Nobuji Saito and
Geoffrey Exoo and
Frank Harary},
title = {The smallest 2-connected cubic bipartite planar nonhamiltonian graph},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {1--6},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90162-5},
doi = {10.1016/0012-365X(82)90162-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AsanoSEH82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AubertS82,
author = {Jacques Aubert and
Bernadette Schneider},
title = {Decomposition de la somme cartesienne d'un cycle et de l'union de
deux cycles hamiltoniens en cycles hamiltoniens},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {7--16},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90163-7},
doi = {10.1016/0012-365X(82)90163-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AubertS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BatageljP82,
author = {Vladimir Batagelj and
Tomaz Pisanski},
title = {Hamiltonian cycles in the cartesian product of a tree and a cycle},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {311--312},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90297-7},
doi = {10.1016/0012-365X(82)90297-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BatageljP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Boccara82,
author = {G. Boccara},
title = {Cycles comme produit de deux permutations de classes donnees},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {129--142},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90282-5},
doi = {10.1016/0012-365X(82)90282-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Boccara82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BressoudZ82,
author = {David M. Bressoud and
Doron Zeilberger},
title = {A short Rogers-Ramanujan bijection},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {313--315},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90298-9},
doi = {10.1016/0012-365X(82)90298-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BressoudZ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Buckley82,
author = {Fred Buckley},
title = {The central ratio of a graph},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {17--21},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90164-9},
doi = {10.1016/0012-365X(82)90164-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Buckley82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BurrEFRS82,
author = {Stefan A. Burr and
Paul Erd{\"{o}}s and
Ralph J. Faudree and
Cecil C. Rousseau and
Richard H. Schelp},
title = {Ramsey-minimal graphs for forests},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {23--32},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90165-0},
doi = {10.1016/0012-365X(82)90165-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BurrEFRS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Cogis82,
author = {Olivier Cogis},
title = {Ferrers digraphs and threshold graphs},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {33--46},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90166-2},
doi = {10.1016/0012-365X(82)90166-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Cogis82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Cogis82a,
author = {Olivier Cogis},
title = {On the Ferrers dimension of a digraph},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {47--52},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90167-4},
doi = {10.1016/0012-365X(82)90167-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Cogis82a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ConwayP82,
author = {John H. Conway and
Vera Pless},
title = {On primes dividing the group order of a doubly-even (72, 36, 16) code
and the group order of a quaternary (24, 12, 10) code},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {157--162},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90284-9},
doi = {10.1016/0012-365X(82)90284-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ConwayP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DarcelZ82,
author = {Nelly Darcel and
Yvette Zimmermann},
title = {Partition en cycles du graphe de comparabilite d'un arbre},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {53--64},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90168-6},
doi = {10.1016/0012-365X(82)90168-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DarcelZ82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Farrell82,
author = {Edward J. Farrell},
title = {Cycle decompositions of complete graphs},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {143--156},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90283-7},
doi = {10.1016/0012-365X(82)90283-7},
timestamp = {Thu, 25 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Farrell82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fouquet82,
author = {Jean{-}Luc Fouquet},
title = {Note sur la non existence d'un snark d'ordre 16},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {163--171},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90285-0},
doi = {10.1016/0012-365X(82)90285-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fouquet82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Gangopadhyay82,
author = {T. Gangopadhyay},
title = {Characterisation of potentially bipartite self-complementary bipartitioned
sequences},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {173--184},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90286-2},
doi = {10.1016/0012-365X(82)90286-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Gangopadhyay82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GrannellG82,
author = {Mike J. Grannell and
Terry S. Griggs},
title = {A cyclic Steiner quadruple system of order 32},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {109--111},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90175-3},
doi = {10.1016/0012-365X(82)90175-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GrannellG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Heydemann82,
author = {Marie{-}Claude Heydemann},
title = {Cycles in strong oriented graphs},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {185--190},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90287-4},
doi = {10.1016/0012-365X(82)90287-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Heydemann82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HsuN82,
author = {Wen{-}Lian Hsu and
George L. Nemhauser},
title = {A polynomial algorithm for the minimum weighted clique cover problem
on claw-free perfect graphs},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {65--71},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90169-8},
doi = {10.1016/0012-365X(82)90169-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HsuN82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jacobson82,
author = {Michael S. Jacobson},
title = {On a generalization of Ramsey theory},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {191--195},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90288-6},
doi = {10.1016/0012-365X(82)90288-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Jacobson82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KelmansL82,
author = {Alexander K. Kelmans and
M. V. Lomonosov},
title = {When m vertices in a k-connected graph cannot be walked round along
a simple cycle},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {317--322},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90299-0},
doi = {10.1016/0012-365X(82)90299-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KelmansL82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KrishnamoorthyP82,
author = {V. Krishnamoorthy and
K. R. Parthasarathy},
title = {On the reconstruction of separable graphs from elementary contractions},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {197--205},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90289-8},
doi = {10.1016/0012-365X(82)90289-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KrishnamoorthyP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Luca82,
author = {Aldo de Luca},
title = {On some combinatorial problems in free monoids},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {207--225},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90290-4},
doi = {10.1016/0012-365X(82)90290-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Luca82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/McDonough82,
author = {T. P. McDonough},
title = {A 2-design admitting Co\({}_{\mbox{3}}\)},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {113--115},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90176-5},
doi = {10.1016/0012-365X(82)90176-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/McDonough82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Picon82,
author = {P. A. Picon},
title = {Un r{\'{e}}sultat d'int{\'{e}}grit{\'{e}}},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {227--241},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90291-6},
doi = {10.1016/0012-365X(82)90291-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Picon82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Polat82,
author = {Norbert Polat},
title = {Sous-graphes tra{\c{c}}ables des graphes infinis},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {243--263},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90292-8},
doi = {10.1016/0012-365X(82)90292-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Polat82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Porubsky82,
author = {Stefan Porubsk{\'{y}}},
title = {A characterization of finite unions of arithmetic sequences},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {73--77},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90170-4},
doi = {10.1016/0012-365X(82)90170-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Porubsky82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Poupard82,
author = {Christiane Poupard},
title = {De nouvelles significations enumeratives des nombres d'entringer},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {265--271},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90293-X},
doi = {10.1016/0012-365X(82)90293-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Poupard82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Pranesachar82,
author = {C. R. Pranesachar},
title = {On the number of two-line and three-line latin rectangles - an alternative
approach},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {79--86},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90171-6},
doi = {10.1016/0012-365X(82)90171-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Pranesachar82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Purdy82,
author = {George B. Purdy},
title = {The independent sets of rank k of a matroid},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {87--91},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90172-8},
doi = {10.1016/0012-365X(82)90172-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Purdy82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Reid82,
author = {K. B. Reid},
title = {Every vertex a king},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {93--98},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90173-X},
doi = {10.1016/0012-365X(82)90173-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Reid82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Roth82,
author = {Richard L. Roth},
title = {Color symmetry and group theory},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {273--296},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90294-1},
doi = {10.1016/0012-365X(82)90294-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Roth82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Schrijver82,
author = {Alexander Schrijver},
title = {On the number of edge-colourings of regular bipartite graphs},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {297--301},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90295-3},
doi = {10.1016/0012-365X(82)90295-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Schrijver82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Ushio82,
author = {Kazuhiko Ushio},
title = {On balanced claw designs of complete multi-partite graphs},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {117--119},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90177-7},
doi = {10.1016/0012-365X(82)90177-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Ushio82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wendell82,
author = {Richard E. Wendell},
title = {A preview of a tolerance approach to sensitivity analysis in linear
programming},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {121--124},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90178-9},
doi = {10.1016/0012-365X(82)90178-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wendell82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Whitesides82,
author = {Sue Whitesides},
title = {A classification of certain graphs with minimal imperfection properties},
journal = {Discret. Math.},
volume = {38},
number = {2-3},
pages = {303--310},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90296-5},
doi = {10.1016/0012-365X(82)90296-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Whitesides82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Witte82,
author = {David S. Witte},
title = {On Hamiltonian circuits in Cayley diagrams},
journal = {Discret. Math.},
volume = {38},
number = {1},
pages = {99--108},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90174-1},
doi = {10.1016/0012-365X(82)90174-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Witte82.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-04-25 12:00 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:
