Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dm/dm164.bht:"
@article{DBLP:journals/dm/Bang-JensenG97a, author = {J{\o}rgen Bang{-}Jensen and Gregory Z. Gutin}, title = {Paths and cycles in extended and decomposable digraphs\({}^{\mbox{, }}\)}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {5--19}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00038-6}, doi = {10.1016/S0012-365X(96)00038-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Bang-JensenG97a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Bielak97, author = {Halina Bielak}, title = {Chromatic uniqueness in a family of 2-connected graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {21--28}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00039-8}, doi = {10.1016/S0012-365X(96)00039-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Bielak97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Broersma97, author = {Haitze J. Broersma}, title = {A note on the minimum size of a vertex pancyclic graph}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {29--32}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00040-4}, doi = {10.1016/S0012-365X(96)00040-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Broersma97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BylkaK97, author = {Stanislaw Bylka and Jan Komar}, title = {Intersection properties of line graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {33--45}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00041-6}, doi = {10.1016/S0012-365X(96)00041-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BylkaK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/CaroRS97, author = {Yair Caro and Yehuda Roditty and Johanan Sch{\"{o}}nheim}, title = {On colored designs - {I}}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {47--65}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00042-8}, doi = {10.1016/S0012-365X(96)00042-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/CaroRS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DellOlmoST97, author = {Paolo Dell'Olmo and Maria Grazia Speranza and Zsolt Tuza}, title = {Efficiency and effectiveness of normal schedules on three dedicated processors}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {67--79}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(97)84781-4}, doi = {10.1016/S0012-365X(97)84781-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/DellOlmoST97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Dinh97, author = {Hoa Vu Dinh}, title = {Path partition number in tough graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {291--294}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00063-5}, doi = {10.1016/S0012-365X(96)00063-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Dinh97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Erdos97a, author = {Paul Erd{\"{o}}s}, title = {Some recent problems and results in graph theory}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {81--85}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00044-1}, doi = {10.1016/S0012-365X(96)00044-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Erdos97a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/FaudreeFR97, author = {Ralph J. Faudree and Evelyne Flandrin and Zdenek Ryj{\'{a}}cek}, title = {Claw-free graphs - {A} survey}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {87--147}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00045-3}, doi = {10.1016/S0012-365X(96)00045-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/FaudreeFR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Gorgol97, author = {Izolda Gorgol}, title = {On bounds for size Ramsey numbers of a complete tripartite graph}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {149--153}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00046-5}, doi = {10.1016/S0012-365X(96)00046-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Gorgol97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Gropp97a, author = {Harald Gropp}, title = {Configurations and graphs - {II}}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {155--163}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00047-7}, doi = {10.1016/S0012-365X(96)00047-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Gropp97a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/GuoPV97, author = {Yubao Guo and Axel Pinkernell and Lutz Volkmann}, title = {On cycles through a given vertex in multipartite tournaments}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {165--170}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00048-9}, doi = {10.1016/S0012-365X(96)00048-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/GuoPV97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HornakJ97, author = {Mirko Horn{\'{a}}k and Stanislav Jendrol'}, title = {On the d-distance face chromatic number of plane graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {171--174}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00049-0}, doi = {10.1016/S0012-365X(96)00049-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HornakJ97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Katona97, author = {Gyula O. H. Katona}, title = {Extremal problems for finite sets and convex hulls - {A} survey}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {175--185}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00050-7}, doi = {10.1016/S0012-365X(96)00050-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Katona97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Katona97a, author = {Gyula Y. Katona}, title = {Toughness and edge-toughness}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {187--196}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00051-9}, doi = {10.1016/S0012-365X(96)00051-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Katona97a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KubalePP97, author = {Marek Kubale and Jaroslaw Pakulski and Konrad Piwakowski}, title = {The smallest hard-to-color graph for the {SL} algorithm}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {197--212}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00052-0}, doi = {10.1016/S0012-365X(96)00052-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KubalePP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KwasnikS97, author = {Maria Kwasnik and Alina Szelecka}, title = {Strong perfectness of the generalized Cartesian product of graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {213--220}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00053-2}, doi = {10.1016/S0012-365X(96)00053-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KwasnikS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Lonc97, author = {Zbigniew Lonc}, title = {Delta-system decompositions of graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {221--224}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00054-4}, doi = {10.1016/S0012-365X(96)00054-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Lonc97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/MajcherM97, author = {Zofia Majcher and Jerzy Michael}, title = {Degree sequences of highly irregular graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {225--236}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(97)84782-6}, doi = {10.1016/S0012-365X(97)84782-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/MajcherM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/MajcherM97a, author = {Zofia Majcher and Jerzy Michael}, title = {Highly irregular graphs with extreme numbers of edges}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {237--242}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00056-8}, doi = {10.1016/S0012-365X(96)00056-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/MajcherM97a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Piwakowski97, author = {Konrad Piwakowski}, title = {On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {243--249}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00057-X}, doi = {10.1016/S0012-365X(96)00057-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Piwakowski97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/RucinskiT97, author = {Andrzej Rucinski and Miroslaw Truszczynski}, title = {A note on local colorings of graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {251--255}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00058-1}, doi = {10.1016/S0012-365X(96)00058-1}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/RucinskiT97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/RycerzWW97, author = {Anna Rycerz and A. Pawel Wojda and Mariusz Wozniak}, title = {Preface}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {1--4}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00037-4}, doi = {10.1016/S0012-365X(96)00037-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/RycerzWW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Ryjacek97, author = {Zdenek Ryj{\'{a}}cek}, title = {Matching extension in K\({}_{\mbox{1, r}}\)-free graphs with independent claw centers}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {257--263}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00059-3}, doi = {10.1016/S0012-365X(96)00059-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Ryjacek97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/SacleW97, author = {Jean{-}Fran{\c{c}}ois Sacl{\'{e}} and Mariusz Wozniak}, title = {A note on packing of three forests}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {265--274}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00060-X}, doi = {10.1016/S0012-365X(96)00060-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/SacleW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Schaar97, author = {G{\"{u}}nter Schaar}, title = {On the Hamiltonicity exponent of directed cacti}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {275--284}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00061-1}, doi = {10.1016/S0012-365X(96)00061-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Schaar97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/SchaarW97, author = {G{\"{u}}nter Schaar and A. Pawel Wojda}, title = {An upper bound for the Hamiltonicity exponent of finite digraphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {313--316}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00066-0}, doi = {10.1016/S0012-365X(96)00066-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/SchaarW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ToppV97, author = {Jerzy Topp and Preben D. Vestergaard}, title = {Totally equimatchable graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {285--290}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00062-3}, doi = {10.1016/S0012-365X(96)00062-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ToppV97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/WlochW97, author = {Andrzej Wloch and Iwona Wloch}, title = {On (k, l)-kernels in generalized products}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {295--301}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00064-7}, doi = {10.1016/S0012-365X(96)00064-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/WlochW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/WojdaV97, author = {A. Pawel Wojda and Paul Vaderlind}, title = {Packing bipartite graphs}, journal = {Discret. Math.}, volume = {164}, number = {1-3}, pages = {303--311}, year = {1997}, url = {https://doi.org/10.1016/S0012-365X(96)00065-9}, doi = {10.1016/S0012-365X(96)00065-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/WojdaV97.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.