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/dm271.bht:"
download as .bib file
@article{DBLP:journals/dm/BrinkG03,
author = {Ren{\'{e}} van den Brink and
Robert P. Gilles},
title = {Ranking by outdegree for directed graphs},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {261--270},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00050-5},
doi = {10.1016/S0012-365X(03)00050-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrinkG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChenTW03,
author = {Yaojun Chen and
Feng Tian and
Bing Wei},
title = {Hamilton-connectivity of 3-domination-critical graphs with alpha leq
delta},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {1--12},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00876-2},
doi = {10.1016/S0012-365X(02)00876-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChenTW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Coker03,
author = {Curtis Coker},
title = {Enumerating a class of lattice paths},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {13--28},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00037-2},
doi = {10.1016/S0012-365X(03)00037-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Coker03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FerrariPPR03,
author = {Luca Ferrari and
Elisa Pergola and
Renzo Pinzani and
Simone Rinaldi},
title = {Jumping succession rules and their generating functions},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {29--50},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00868-3},
doi = {10.1016/S0012-365X(02)00868-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FerrariPPR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Gao03,
author = {Weidong Gao},
title = {On zero-sum subsequences of restricted size {II}},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {51--59},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00038-4},
doi = {10.1016/S0012-365X(03)00038-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Gao03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GoddardRS03,
author = {Wayne Goddard and
Michael Edwin Raines and
Peter J. Slater},
title = {Distance and connectivity measures in permutation graphs},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {61--70},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00870-1},
doi = {10.1016/S0012-365X(02)00870-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GoddardRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GovaertM03,
author = {Eline Govaert and
Hendrik Van Maldeghem},
title = {Forgetful polygons as generalizations of semi-affine planes},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {71--100},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00871-3},
doi = {10.1016/S0012-365X(02)00871-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GovaertM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Henning03,
author = {Michael A. Henning},
title = {Defending the Roman Empire from multiple attacks},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {101--115},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00040-2},
doi = {10.1016/S0012-365X(03)00040-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Henning03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Huang03,
author = {Yuanqiu Huang},
title = {Maximum genus and chromatic number of graphs},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {117--127},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00289-9},
doi = {10.1016/S0012-365X(03)00289-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Huang03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KabadiP03,
author = {Santosh N. Kabadi and
Abraham P. Punnen},
title = {Weighted graphs with all Hamiltonian cycles of the same length},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {129--139},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00041-4},
doi = {10.1016/S0012-365X(03)00041-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KabadiP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kelmans03,
author = {Alexander K. Kelmans},
title = {On graph closures},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {141--168},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00573-3},
doi = {10.1016/S0012-365X(02)00573-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kelmans03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Korff03,
author = {Joshua Von Korff},
title = {Classification of greedy subset-sum-distinct-sequences},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {271--282},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00875-0},
doi = {10.1016/S0012-365X(02)00875-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Korff03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lalonde03,
author = {Pierre Lalonde},
title = {Lattice paths and the antiautomorphism of the poset of descending
plane partitions},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {311--319},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00159-6},
doi = {10.1016/S0012-365X(03)00159-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lalonde03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LiNR03,
author = {Xueliang Li and
Victor Neumann{-}Lara and
Eduardo Rivera{-}Campo},
title = {On a tree graph defined by a set of cycles},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {303--310},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00132-8},
doi = {10.1016/S0012-365X(03)00132-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LiNR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lin03,
author = {Wensong Lin},
title = {Some star extremal circulant graphs},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {169--177},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00872-5},
doi = {10.1016/S0012-365X(02)00872-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lin03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoeblV03,
author = {Martin Loebl and
Jan Vondr{\'{a}}k},
title = {Towards a theory of frustrated degeneracy},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {179--193},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00043-8},
doi = {10.1016/S0012-365X(03)00043-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LoeblV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MauduitS03,
author = {Christian Mauduit and
Andr{\'{a}}s S{\'{a}}rk{\"{o}}zy},
title = {On the measures of pseudorandomness of binary sequences},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {195--207},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00044-X},
doi = {10.1016/S0012-365X(03)00044-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MauduitS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MiaoPW03,
author = {Lianying Miao and
Shiyou Pang and
Jianliang Wu},
title = {An upper bound on the number of edges of edge-coloring critical graphs
with high maximum degree},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {321--325},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00290-5},
doi = {10.1016/S0012-365X(03)00290-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MiaoPW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Myers03,
author = {Joseph Samuel Myers},
title = {The extremal function for unbalanced bipartite minors},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {209--222},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00051-7},
doi = {10.1016/S0012-365X(03)00051-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Myers03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Nenov03,
author = {Nedyalko Dimov Nenov},
title = {On the triangle vertex Folkman numbers},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {327--334},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00134-1},
doi = {10.1016/S0012-365X(03)00134-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Nenov03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/OmoomiP03,
author = {Behnaz Omoomi and
Yee{-}Hock Peng},
title = {Chromatic equivalence classes of certain generalized polygon trees,
{III}},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {223--234},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00874-9},
doi = {10.1016/S0012-365X(02)00874-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/OmoomiP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Rautenbach03,
author = {Dieter Rautenbach},
title = {A note on trees of maximum weight and restricted degrees},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {335--342},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00135-3},
doi = {10.1016/S0012-365X(03)00135-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Rautenbach03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Salazar03,
author = {Gelasio Salazar},
title = {Infinite families of crossing-critical graphs with given average degree},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {343--350},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00136-5},
doi = {10.1016/S0012-365X(03)00136-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Salazar03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Stojakovic03,
author = {Milos Stojakovic},
title = {Limit shape of optimal convex lattice polygons in the sense of different
metrics},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {235--249},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00045-1},
doi = {10.1016/S0012-365X(03)00045-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Stojakovic03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Switalski03,
author = {Zbigniew Switalski},
title = {Half-integrality of vertices of the generalized transitive tournament
polytope (\emph{n}=6)},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {251--260},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00046-3},
doi = {10.1016/S0012-365X(03)00046-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Switalski03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wilson03,
author = {Steve Wilson},
title = {A worthy family of semisymmetric graphs},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {283--294},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00048-7},
doi = {10.1016/S0012-365X(03)00048-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wilson03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/XieY03,
author = {Dezheng Xie and
Wanlian Yang},
title = {The total chromatic number of graphs of even order and high degree},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {295--302},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00049-9},
doi = {10.1016/S0012-365X(03)00049-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/XieY03.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-07-27 18:17 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:
