Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dm/dm223.bht:"
@article{DBLP:journals/dm/AdamsBK00, author = {Peter Adams and Darryn E. Bryant and Abdollah Khodkar}, title = {On Alspach's conjecture with two even cycle lengths}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {1--12}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00051-0}, doi = {10.1016/S0012-365X(00)00051-0}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/AdamsBK00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Asratian00, author = {Armen S. Asratian}, title = {Some results on an edge coloring problem of Folkman and Fulkerson}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {13--25}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00061-3}, doi = {10.1016/S0012-365X(00)00061-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Asratian00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BertheV00, author = {Val{\'{e}}rie Berth{\'{e}} and Laurent Vuillon}, title = {Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {27--53}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00039-X}, doi = {10.1016/S0012-365X(00)00039-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BertheV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BoudabbousDI00, author = {Youssef Boudabbous and Jamel Dammak and Pierre Ille}, title = {Indecomposability and duality of tournaments}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {55--82}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00040-6}, doi = {10.1016/S0012-365X(00)00040-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BoudabbousDI00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/CarnielliC00, author = {Walter Alexandre Carnielli and Emerson L. Monte Carmelo}, title = {\emph{K}\({}_{\mbox{2, 2}}\)-\emph{K}\({}_{\mbox{1, n}}\) and \emph{K}\({}_{\mbox{2, n}}\)-\emph{K}\({}_{\mbox{2, n}}\) bipartite Ramsey numbers}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {83--92}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00041-8}, doi = {10.1016/S0012-365X(00)00041-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/CarnielliC00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Chen00, author = {Yong{-}Gao Chen}, title = {On sums and intersects of sequences}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {351--354}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00097-2}, doi = {10.1016/S0012-365X(00)00097-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Chen00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Chevallier00, author = {Nicolas Chevallier}, title = {Three distance theorem and grid graph}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {355--362}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00098-4}, doi = {10.1016/S0012-365X(00)00098-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Chevallier00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DaneshgarN00, author = {Amir Daneshgar and Reza Naserasr}, title = {On small uniquely vertex-colourable graphs and Xu's conjecture}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {93--108}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00042-X}, doi = {10.1016/S0012-365X(00)00042-X}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/DaneshgarN00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Estivill-CastroNU00, author = {Vladimir Estivill{-}Castro and Marc Noy and Jorge Urrutia}, title = {On the chromatic number of tree graphs}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {363--366}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00092-3}, doi = {10.1016/S0012-365X(00)00092-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Estivill-CastroNU00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/EvansIN00, author = {Anthony B. Evans and Garth Isaak and Darren A. Narayan}, title = {Representations of graphs modulo \emph{n}}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {109--123}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00062-5}, doi = {10.1016/S0012-365X(00)00062-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/EvansIN00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Galatolo00, author = {Stefano Galatolo}, title = {A proof of the Beyer-Stein-Ulam relation between complexity and entropy}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {367--372}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00100-X}, doi = {10.1016/S0012-365X(00)00100-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Galatolo00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Harada00, author = {Masaaki Harada}, title = {On the existence of extremal Type {II} codes over Z\({}_{\mbox{6}}\)}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {373--378}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00101-1}, doi = {10.1016/S0012-365X(00)00101-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Harada00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HoCW00, author = {Ting{-}Yem Ho and Jou{-}Ming Chang and Yue{-}Li Wang}, title = {On the powers of graphs with bounded asteroidal number}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {125--133}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00043-1}, doi = {10.1016/S0012-365X(00)00043-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HoCW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Jaffe00, author = {David B. Jaffe}, title = {Optimal binary linear codes of length leq 30}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {135--155}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(99)00135-1}, doi = {10.1016/S0012-365X(99)00135-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Jaffe00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KlostermeyerS00, author = {William Klostermeyer and Lubom{\'{\i}}r Solt{\'{e}}s}, title = {An extremal connectivity parameter of tournaments}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {157--173}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00014-5}, doi = {10.1016/S0012-365X(00)00014-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KlostermeyerS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/LassmannS00, author = {Gunter Lassmann and Eric Sparla}, title = {A classification of centrally-symmetric and cyclic 12-vertex triangulations of \emph{S}\({}^{\mbox{2}}\)?\emph{S}\({}^{\mbox{2}}\)}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {175--187}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00044-3}, doi = {10.1016/S0012-365X(00)00044-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/LassmannS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Lewis00, author = {Heather A. Lewis}, title = {Homotopy in \emph{Q}-polynomial distance-regular graphs}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {189--206}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00045-5}, doi = {10.1016/S0012-365X(00)00045-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Lewis00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Li00, author = {Weimin Li}, title = {Idempotent endomorphisms of a graph}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {379--386}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00105-9}, doi = {10.1016/S0012-365X(00)00105-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Li00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/LiS00, author = {Rao Li and Richard H. Schelp}, title = {Some hamiltonian properties of \emph{L}\({}_{\mbox{1}}\)-graphs}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {207--216}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00046-7}, doi = {10.1016/S0012-365X(00)00046-7}, timestamp = {Wed, 04 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/LiS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/LinhartYP00, author = {Johann Linhart and Yanling Yang and Martin Philipp}, title = {Arrangements of hemispheres and halfspaces}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {217--226}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(98)00360-4}, doi = {10.1016/S0012-365X(98)00360-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/LinhartYP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/McDiarmid00, author = {Colin J. H. McDiarmid}, title = {Frequency-distance constraints with large distances}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {227--251}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00016-9}, doi = {10.1016/S0012-365X(00)00016-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/McDiarmid00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/McKee00, author = {Terry A. McKee}, title = {Induced cycle structure and outerplanarity}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {387--392}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00103-5}, doi = {10.1016/S0012-365X(00)00103-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/McKee00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Ostergard00, author = {Patric R. J. {\"{O}}sterg{\aa}rd}, title = {Classification of binary/ternary one-error-correcting codes}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {253--262}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00017-0}, doi = {10.1016/S0012-365X(00)00017-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Ostergard00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Prisner00, author = {Erich Prisner}, title = {Recognizing random intersection graphs}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {263--274}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00018-2}, doi = {10.1016/S0012-365X(00)00018-2}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/Prisner00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/RenL00, author = {Han Ren and Yanpei Liu}, title = {Bisingular maps on the sphere and the projective plane}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {275--285}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00015-7}, doi = {10.1016/S0012-365X(00)00015-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/RenL00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Tomescu00, author = {Ioan Tomescu}, title = {On the number of large h-hypergraphs with a fixed diameter}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {287--297}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00019-4}, doi = {10.1016/S0012-365X(00)00019-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Tomescu00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/UshioO00, author = {Kazuhiko Ushio and Yoshikazu Ohtsubo}, title = {C\({}_{\mbox{k}}\)-factorization of symmetric complete bipartite and tripartite multi-digraphs}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {393--397}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00104-7}, doi = {10.1016/S0012-365X(00)00104-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/UshioO00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Wu00, author = {Pou{-}Lin Wu}, title = {Extremal graphs with prescribed circumference and cocircumference}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {299--308}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00047-9}, doi = {10.1016/S0012-365X(00)00047-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Wu00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/XuW00, author = {Jin Xu and C. K. Wong}, title = {Self-complementary graphs and Ramsey numbers Part {I:} the decomposition and construction of self-complementary graphs}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {309--326}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(00)00020-0}, doi = {10.1016/S0012-365X(00)00020-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/XuW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ZhangLB00, author = {Shenggui Zhang and Xueliang Li and Hajo Broersma}, title = {Heavy paths and cycles in weighted graphs}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {327--336}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(99)00413-6}, doi = {10.1016/S0012-365X(99)00413-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ZhangLB00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ZhangYG00, author = {Yuanping Zhang and Xuerong Yong and Mordecai J. Golin}, title = {The number of spanning trees in circulant graphs}, journal = {Discret. Math.}, volume = {223}, number = {1-3}, pages = {337--350}, year = {2000}, url = {https://doi.org/10.1016/S0012-365X(99)00414-8}, doi = {10.1016/S0012-365X(99)00414-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ZhangYG00.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.