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/dm226.bht:"
download as .bib file
@article{DBLP:journals/dm/AbelGMZ01,
author = {R. Julian R. Abel and
Malcolm Greig and
Ying Miao and
Lie Zhu},
title = {Resolvable BIBDs with block size 7 and index 6},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {1--20},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00123-0},
doi = {10.1016/S0012-365X(00)00123-0},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AbelGMZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AdinPR01,
author = {Ron M. Adin and
Alexander Postnikov and
Yuval Roichman},
title = {On characters of Weyl groups},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {355--358},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00165-5},
doi = {10.1016/S0012-365X(00)00165-5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AdinPR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AgnarssonDS01,
author = {Geir Agnarsson and
Benjamin Doerr and
Tomasz Schoen},
title = {Coloring \emph{t}-dimensional \emph{m}-Boxes},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {21--33},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00180-1},
doi = {10.1016/S0012-365X(00)00180-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AgnarssonDS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AlekseevL01,
author = {Vladimir E. Alekseev and
Vadim V. Lozin},
title = {On orthogonal representations of graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {359--363},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00168-0},
doi = {10.1016/S0012-365X(00)00168-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AlekseevL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BeezerRS01,
author = {Robert A. Beezer and
John E. Riegsecker and
Bryan A. Smith},
title = {Using minimum degree to bound average distance},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {365--371},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00156-4},
doi = {10.1016/S0012-365X(00)00156-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BeezerRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BogartJLM01,
author = {Kenneth P. Bogart and
Michael S. Jacobson and
Larry J. Langley and
Fred R. McMorris},
title = {Tolerance orders and bipartite unit tolerance graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {35--50},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00124-2},
doi = {10.1016/S0012-365X(00)00124-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BogartJLM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BouyuklievJ01,
author = {Iliya Bouyukliev and
David B. Jaffe},
title = {Optimal binary linear codes of dimension at most seven},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {51--70},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00125-4},
doi = {10.1016/S0012-365X(00)00125-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BouyuklievJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrualdiS01,
author = {Richard A. Brualdi and
Jian Shen},
title = {Diameter of the {NEPS} of bipartite graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {373--376},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00160-6},
doi = {10.1016/S0012-365X(00)00160-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrualdiS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CairnsK01,
author = {Grant Cairns and
Deborah M. King},
title = {All odd musquashes are standard},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {71--91},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00126-6},
doi = {10.1016/S0012-365X(00)00126-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CairnsK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChaoK01,
author = {J. M. Chao and
Hitoshi Kaneta},
title = {Classical arcs in PG(\emph{r, q}) for 23 leq \emph{q} leq 29},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {377--385},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00169-2},
doi = {10.1016/S0012-365X(00)00169-2},
timestamp = {Wed, 29 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChaoK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChartrandVZ01,
author = {Gary Chartrand and
Donald W. VanderJagt and
Ping Zhang},
title = {On the planarity of iterated jump graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {93--106},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00182-5},
doi = {10.1016/S0012-365X(00)00182-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChartrandVZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Chastand01,
author = {Marc Chastand},
title = {Fiber-complemented graphs -- {I:} structure and invariant subgraphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {107--141},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00183-7},
doi = {10.1016/S0012-365X(00)00183-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Chastand01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ConfortiR01,
author = {Michele Conforti and
Romeo Rizzi},
title = {Shortest paths in conservative graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {143--153},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00128-X},
doi = {10.1016/S0012-365X(00)00128-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ConfortiR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DAntonaMZ01,
author = {Ottavio M. D'Antona and
Carlo Mereghetti and
Fabio Zamparini},
title = {The 224 non-chordal graphs on less than 10 vertices whose chromatic
polynomials have no complex roots},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {387--396},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00170-9},
doi = {10.1016/S0012-365X(00)00170-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DAntonaMZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FiolGY01,
author = {Miguel Angel Fiol and
Ernest Garriga and
Jos{\'{e}} Luis Andres Yebra},
title = {Boundary graphs: The limit case of a spectral property},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {155--173},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00184-9},
doi = {10.1016/S0012-365X(00)00184-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FiolGY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ForgeA01,
author = {David Forge and
Jorge L. Ram{\'{\i}}rez Alfons{\'{\i}}n},
title = {On reconstructing arrangements from their sets of simplices},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {175--190},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00185-0},
doi = {10.1016/S0012-365X(00)00185-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ForgeA01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FuH01,
author = {Hung{-}Lin Fu and
Wei{-}Hsin Hu},
title = {A note on ascending subgraph decompositions of complete multipartite
graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {397--402},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00171-0},
doi = {10.1016/S0012-365X(00)00171-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FuH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FuTX01,
author = {Hung{-}Lin Fu and
Ming{-}Chun Tsai and
N. H. Xuong},
title = {The decay number and the maximum genus of diameter 2 graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {191--197},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00130-8},
doi = {10.1016/S0012-365X(00)00130-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FuTX01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FujishigeP01,
author = {Satoru Fujishige and
Sachin B. Patkar},
title = {Realization of set functions as cut functions of graphs and hypergraphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {199--210},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00164-3},
doi = {10.1016/S0012-365X(00)00164-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FujishigeP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Hellerstein01,
author = {Lisa Hellerstein},
title = {On generalized constraints and certificates},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {211--232},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00166-7},
doi = {10.1016/S0012-365X(00)00166-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Hellerstein01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HellesethRY01a,
author = {Tor Helleseth and
Chunming Rong and
Kyeongcheol Yang},
title = {New 3-designs from Goethals codes over \emph{Z}\({}_{\mbox{4}}\)},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {403--409},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00161-8},
doi = {10.1016/S0012-365X(00)00161-8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/HellesethRY01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Katona01,
author = {Zsolt Katona},
title = {Intersecting families of sets, no \emph{l} containing two common elements},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {233--241},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00131-X},
doi = {10.1016/S0012-365X(00)00131-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Katona01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KingstonS01,
author = {Jeffrey H. Kingston and
Nicholas Paul Sheppard},
title = {On the hardness of computing maximum self-reduction sequences},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {243--253},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00132-1},
doi = {10.1016/S0012-365X(00)00132-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KingstonS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KnopfmacherP01,
author = {Arnold Knopfmacher and
Helmut Prodinger},
title = {Combinatorics of geometrically distributed random variables: Value
and position of the rth left-to-right maximum},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {255--267},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00133-3},
doi = {10.1016/S0012-365X(00)00133-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KnopfmacherP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MillerS01,
author = {Mirka Miller and
Jozef Sir{\'{a}}n},
title = {Digraphs of degree two which miss the Moore bound by two},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {269--280},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00134-5},
doi = {10.1016/S0012-365X(00)00134-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MillerS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Morgenstern01,
author = {Dietrich Morgenstern},
title = {Proof of a conjecture by Walter Deuber concerning the distances between
points of two types in \emph{R}\({}^{\mbox{d}}\)},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {347--349},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00209-0},
doi = {10.1016/S0012-365X(00)00209-0},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Morgenstern01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MortveitR01,
author = {Henning S. Mortveit and
Christian M. Reidys},
title = {Discrete, sequential dynamical systems},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {281--295},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00115-1},
doi = {10.1016/S0012-365X(00)00115-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MortveitR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RautenbachZ01,
author = {Dieter Rautenbach and
Vadim E. Zverovich},
title = {Perfect graphs of strong domination and independent strong domination},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {297--311},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00116-3},
doi = {10.1016/S0012-365X(00)00116-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RautenbachZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RodittySY01,
author = {Yehuda Roditty and
Barack Shoham and
Raphael Yuster},
title = {Monotone paths in edge-ordered sparse graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {411--417},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00174-6},
doi = {10.1016/S0012-365X(00)00174-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RodittySY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ShiZ01,
author = {Ling{-}sheng Shi and
Ke{-}min Zhang},
title = {A bound for multicolor Ramsey numbers},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {419--421},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00175-8},
doi = {10.1016/S0012-365X(00)00175-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ShiZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Skrekovski01,
author = {Riste Skrekovski},
title = {Two relations for median graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {351--353},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00120-5},
doi = {10.1016/S0012-365X(00)00120-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Skrekovski01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Szpiro01,
author = {George G. Szpiro},
title = {The number of permutations with a given signature, and the expectations
of their elements},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {423--430},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00176-X},
doi = {10.1016/S0012-365X(00)00176-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Szpiro01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tuliani01,
author = {Jonathan Tuliani},
title = {De Bruijn sequences with efficient decoding algorithms},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {313--336},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00117-5},
doi = {10.1016/S0012-365X(00)00117-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tuliani01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wang01,
author = {Stephen S. Wang},
title = {Pebbling and Graham's Conjecture},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {431--438},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00177-1},
doi = {10.1016/S0012-365X(00)00177-1},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Wang01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/WeiW01,
author = {Ping{-}Hong Wei and
Chih{-}Wen Weng},
title = {A typical vertex of a tree},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {337--345},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00135-7},
doi = {10.1016/S0012-365X(00)00135-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/WeiW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Woan01,
author = {Wen{-}Jin Woan},
title = {Area of Catalan paths},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {439--444},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00162-X},
doi = {10.1016/S0012-365X(00)00162-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Woan01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Zgrablic01,
author = {Boris Zgrablic},
title = {On quasiabelian Cayley graphs},
journal = {Discret. Math.},
volume = {226},
number = {1-3},
pages = {445--447},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00178-3},
doi = {10.1016/S0012-365X(00)00178-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Zgrablic01.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-06-10 14:52 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:
