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/dm233.bht:"
download as .bib file
@article{DBLP:journals/dm/BarbosaH01,
author = {Rommel M. Barbosa and
Bert L. Hartnell},
title = {Characterization of \emph{Z}\({}_{\mbox{m}}\)-well-covered graphs
for some classes of graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {293--297},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00247-8},
doi = {10.1016/S0012-365X(00)00247-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BarbosaH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Barre01,
author = {Vincent Barr{\'{e}}},
title = {On vertex neighborhood in minimal imperfect graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {211--218},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00240-5},
doi = {10.1016/S0012-365X(00)00240-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Barre01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BozaDMM01,
author = {Luis Boza and
Maria Teresa Davila and
Alberto M{\'{a}}rquez and
Rafael Moyano},
title = {Miscellaneous properties of embeddings of line, total and middle graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {37--54},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00225-9},
doi = {10.1016/S0012-365X(00)00225-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BozaDMM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaR01,
author = {Hajo Broersma and
Zdenek Ryj{\'{a}}cek},
title = {Strengthening the closure concept in claw-free graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {55--63},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00226-0},
doi = {10.1016/S0012-365X(00)00226-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CahaK01,
author = {Rostislav Caha and
V{\'{a}}clav Koubek},
title = {Optimal embeddings of generalized ladders into hypercubes},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {65--83},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00227-2},
doi = {10.1016/S0012-365X(00)00227-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CahaK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CaiFL01,
author = {Mao{-}cheng Cai and
Evelyne Flandrin and
Hao Li},
title = {On quasifactorability in graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {85--92},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00228-4},
doi = {10.1016/S0012-365X(00)00228-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CaiFL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CrapoR01,
author = {Henry Crapo and
Pierre Rosenstiehl},
title = {On lacets and their manifolds},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {299--320},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00248-X},
doi = {10.1016/S0012-365X(00)00248-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CrapoR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Enomoto01,
author = {Hikoe Enomoto},
title = {Graph partition problems into cycles and paths},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {93--101},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00229-6},
doi = {10.1016/S0012-365X(00)00229-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Enomoto01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FerreroP01,
author = {Daniela Ferrero and
Carles Padr{\'{o}}},
title = {New bounds on the diameter vulnerability of iterated line digraphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {103--113},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00230-2},
doi = {10.1016/S0012-365X(00)00230-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FerreroP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FiedlerKN01,
author = {Miroslav Fiedler and
Jan Kratochv{\'{\i}}l and
Jaroslav Nesetril},
title = {Foreword},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {1--2},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00223-5},
doi = {10.1016/S0012-365X(00)00223-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FiedlerKN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Froncek01a,
author = {Dalibor Froncek},
title = {On seed graphs with more than two components},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {115--126},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00231-4},
doi = {10.1016/S0012-365X(00)00231-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Froncek01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HarmincS01,
author = {Mat{\'{u}}s Harminc and
Roman Sot{\'{a}}k},
title = {Graphs with average labellings},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {127--132},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00232-6},
doi = {10.1016/S0012-365X(00)00232-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HarmincS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Hashemi01,
author = {S. Mehdi Hashemi},
title = {Digraph embedding},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {321--328},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00249-1},
doi = {10.1016/S0012-365X(00)00249-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Hashemi01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Havet01,
author = {Fr{\'{e}}d{\'{e}}ric Havet},
title = {Channel assignment and multicolouring of the induced subgraphs of
the triangular lattice},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {219--231},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00241-7},
doi = {10.1016/S0012-365X(00)00241-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Havet01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HeckmanT01,
author = {Christopher Carl Heckman and
Robin Thomas},
title = {A new proof of the independence ratio of triangle-free cubic graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {233--237},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00242-9},
doi = {10.1016/S0012-365X(00)00242-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HeckmanT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HrnciarH01,
author = {Pavel Hrnciar and
Alfonz Haviar},
title = {All trees of diameter five are graceful},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {133--150},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00233-8},
doi = {10.1016/S0012-365X(00)00233-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HrnciarH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JendrolV01,
author = {Stanislav Jendrol' and
Heinz{-}J{\"{u}}rgen Voss},
title = {Light subgraphs of multigraphs on compact 2-dimensional manifolds},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {329--351},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00250-8},
doi = {10.1016/S0012-365X(00)00250-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JendrolV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KemnitzM01,
author = {Arnfried Kemnitz and
Massimiliano Marangio},
title = {Chromatic numbers of integer distance graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {239--246},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00243-0},
doi = {10.1016/S0012-365X(00)00243-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KemnitzM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Klesc01,
author = {Mari{\'{a}}n Klesc},
title = {The crossing numbers of Cartesian products of paths with 5-vertex
graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {353--359},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00251-X},
doi = {10.1016/S0012-365X(00)00251-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Klesc01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KnorN01,
author = {Martin Knor and
Ludov{\'{\i}}t Niepel},
title = {Diameter in iterated path graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {151--161},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00234-X},
doi = {10.1016/S0012-365X(00)00234-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KnorN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kochol01,
author = {Martin Kochol},
title = {Stable dominating circuits in snarks},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {247--256},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00244-2},
doi = {10.1016/S0012-365X(00)00244-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kochol01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KostochkaNS01,
author = {Alexandr V. Kostochka and
Jaroslav Nesetril and
Petra Smol{\'{\i}}kov{\'{a}}},
title = {Colorings and homomorphisms of degenerate and bounded degree graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {257--276},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00245-4},
doi = {10.1016/S0012-365X(00)00245-4},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/KostochkaNS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KostochkaW01a,
author = {Alexandr V. Kostochka and
Douglas R. Woodall},
title = {Sparse sets in the complements of graphs with given girth},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {163--174},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00235-1},
doi = {10.1016/S0012-365X(00)00235-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KostochkaW01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoeblM01,
author = {Martin Loebl and
Mart{\'{\i}}n Matamala},
title = {Some remarks on cycles in graphs and digraphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {175--182},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00236-3},
doi = {10.1016/S0012-365X(00)00236-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LoeblM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Matousek01,
author = {Jir{\'{\i}} Matousek},
title = {Lower bound on the minus-domination number},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {361--370},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00252-1},
doi = {10.1016/S0012-365X(00)00252-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Matousek01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MaxovaN01,
author = {Jana Maxov{\'{a}} and
Jaroslav Nesetril},
title = {On oriented path double covers},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {371--380},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00253-3},
doi = {10.1016/S0012-365X(00)00253-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MaxovaN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/NesetrilMN01,
author = {Jaroslav Nesetril and
Eva Milkov{\'{a}} and
Helena Nesetrilov{\'{a}}},
title = {Otakar Boruvka on minimum spanning tree problem Translation of both
the 1926 papers, comments, history},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {3--36},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00224-7},
doi = {10.1016/S0012-365X(00)00224-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/NesetrilMN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/NesetrilZ01,
author = {Jaroslav Nesetril and
Xuding Zhu},
title = {Construction of sparse graphs with prescribed circular colorings},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {277--291},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00246-6},
doi = {10.1016/S0012-365X(00)00246-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/NesetrilZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/NowakowskiW01,
author = {Richard J. Nowakowski and
Carol A. Whitehead},
title = {Ordered graceful labellings of the 2-star},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {183--191},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00237-5},
doi = {10.1016/S0012-365X(00)00237-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/NowakowskiW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tewes01,
author = {Meike Tewes},
title = {Pancyclic in-tournaments},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {193--204},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00238-7},
doi = {10.1016/S0012-365X(00)00238-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tewes01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wozniak01,
author = {Mariusz Wozniak},
title = {Note on compact packing of a graph},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {205--210},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00239-9},
doi = {10.1016/S0012-365X(00)00239-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wozniak01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZmazekZ01,
author = {Blaz Zmazek and
Janez Zerovnik},
title = {On recognizing Cartesian graph bundles},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {381--391},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00254-5},
doi = {10.1016/S0012-365X(00)00254-5},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ZmazekZ01.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-08-15 21:05 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:
