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/dm222.bht:"
download as .bib file
@article{DBLP:journals/dm/Axenovich00,
author = {Maria Axenovich},
title = {A generalized Ramsey problem},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {247--249},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00052-2},
doi = {10.1016/S0012-365X(00)00052-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Axenovich00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BousquetLL00,
author = {Michel Bousquet and
Gilbert Labelle and
Pierre Leroux},
title = {Enumeration of planar two-face maps},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {1--25},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00406-9},
doi = {10.1016/S0012-365X(99)00406-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BousquetLL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChangF00,
author = {Yanxun Chang and
Giovanni Lo Faro},
title = {Existence of DBIBDs with block size not divided by four},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {27--40},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00003-0},
doi = {10.1016/S0012-365X(00)00003-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChangF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CignoliT00,
author = {Roberto Cignoli and
Antoni Torrens},
title = {Free Stone algebras},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {251--257},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00053-4},
doi = {10.1016/S0012-365X(00)00053-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CignoliT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CortesN00,
author = {Carmen Cort{\'{e}}s and
Atsuhiro Nakamoto},
title = {Diagonal flips in outer-Klein-bottle triangulations},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {41--50},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00004-2},
doi = {10.1016/S0012-365X(00)00004-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CortesN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DamanikZ00,
author = {David Damanik and
Douglas Zare},
title = {Palindrome complexity bounds for primitive substitution sequences},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {259--267},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00054-6},
doi = {10.1016/S0012-365X(00)00054-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DamanikZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Damaschke00,
author = {Peter Damaschke},
title = {Degree-preserving spanning trees in small-degree graphs},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {51--60},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00005-4},
doi = {10.1016/S0012-365X(00)00005-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Damaschke00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DongKTLH00,
author = {Feng Ming Dong and
Khee Meng Koh and
Kee L. Teo and
Charles H. C. Little and
Michael D. Hendy},
title = {An attempt to classify bipartite graphs by chromatic polynomials},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {73--88},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00007-8},
doi = {10.1016/S0012-365X(00)00007-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DongKTLH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FuS00,
author = {Hung{-}Lin Fu and
Chin{-}Lin Shiue},
title = {The optimal pebbling number of the complete \emph{m}-ary tree},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {89--100},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00008-X},
doi = {10.1016/S0012-365X(00)00008-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FuS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GalluccioHN00,
author = {Anna Galluccio and
Pavol Hell and
Jaroslav Nesetril},
title = {The complexity of \emph{H}-colouring of bounded degree graphs},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {101--109},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00009-1},
doi = {10.1016/S0012-365X(00)00009-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GalluccioHN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Gao00,
author = {Weidong Gao},
title = {On Davenport's constant of finite abelian groups with rank three},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {111--124},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00010-8},
doi = {10.1016/S0012-365X(00)00010-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Gao00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GutinTY00,
author = {Gregory Z. Gutin and
Meike Tewes and
Anders Yeo},
title = {Longest paths in strong spanning oriented subgraphs of strong semicomplete
multipartite digraphs},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {269--274},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00055-8},
doi = {10.1016/S0012-365X(00)00055-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GutinTY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HabsiegerP00,
author = {Laurent Habsieger and
Alain Plagne},
title = {New lower bounds for covering codes},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {125--149},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00011-X},
doi = {10.1016/S0012-365X(00)00011-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HabsiegerP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HedetniemiHR00,
author = {Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Douglas F. Rall},
title = {Acyclic domination},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {151--165},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00012-1},
doi = {10.1016/S0012-365X(00)00012-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HedetniemiHR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HorakS00,
author = {Peter Hor{\'{a}}k and
Ladislav Stacho},
title = {A lower bound on the number of hamiltonian cycles},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {275--280},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00060-1},
doi = {10.1016/S0012-365X(00)00060-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HorakS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jakubikova-Studenovska00,
author = {Danica Jakub{\'{\i}}kov{\'{a}}{-}Studenovsk{\'{a}}},
title = {Unoriented graphs of monounary algebras},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {167--179},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00410-0},
doi = {10.1016/S0012-365X(99)00410-0},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Jakubikova-Studenovska00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jonasson00,
author = {Johan Jonasson},
title = {An upper bound on the cover time for powers of graphs},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {181--190},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00013-3},
doi = {10.1016/S0012-365X(00)00013-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Jonasson00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KangY00,
author = {Liying Kang and
Jinjiang Yuan},
title = {Bondage number of planar graphs},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {191--198},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00405-7},
doi = {10.1016/S0012-365X(99)00405-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KangY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lozin00,
author = {Vadim V. Lozin},
title = {Conic reduction of graphs for the stable set problem},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {199--211},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00408-2},
doi = {10.1016/S0012-365X(99)00408-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lozin00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MengW00,
author = {Jixiang Meng and
Jianzhong Wang},
title = {A classification of 2-arc-transitive circulant digraphs},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {281--284},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00056-X},
doi = {10.1016/S0012-365X(00)00056-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MengW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Nishimura00,
author = {Tsuyoshi Nishimura},
title = {On 1-factors and matching extension},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {285--290},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00057-1},
doi = {10.1016/S0012-365X(00)00057-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Nishimura00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SantosM00,
author = {Jos{\'{e}} Pl{\'{\i}}nio O. Santos and
Paulo Mondek},
title = {A family of partitions with attached parts and 'N copies of N'},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {213--222},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00409-4},
doi = {10.1016/S0012-365X(99)00409-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SantosM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tijdeman00,
author = {Robert Tijdeman},
title = {Fraenkel's conjecture for six sequences},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {223--234},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00411-2},
doi = {10.1016/S0012-365X(99)00411-2},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Tijdeman00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wagner00,
author = {Carl G. Wagner},
title = {The Carlitz lattice path polynomials},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {291--298},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00058-3},
doi = {10.1016/S0012-365X(00)00058-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wagner00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/WerraHKM00,
author = {Dominique de Werra and
Alain Hertz and
Daniel Kobler and
Nadimpalli V. R. Mahadev},
title = {Feasible edge colorings of trees with cardinality constraints},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {61--72},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00006-6},
doi = {10.1016/S0012-365X(00)00006-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/WerraHKM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Yang00,
author = {Winston C. Yang},
title = {Derivatives are essentially integer partitions},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {235--245},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00412-4},
doi = {10.1016/S0012-365X(99)00412-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Yang00.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-23 21:26 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:
