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/dm121.bht:"
download as .bib file
@article{DBLP:journals/dm/Bielak93,
author = {Halina Bielak},
title = {Graphs with special neighbourhood orderings of vertices},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {3--9},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90531-W},
doi = {10.1016/0012-365X(93)90531-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Bielak93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BorowieckiD93a,
author = {Mieczyslaw Borowiecki and
Ewa Drgas{-}Burchardt},
title = {Classes of chromatically unique or equivalent graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {11--18},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90532-X},
doi = {10.1016/0012-365X(93)90532-X},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BorowieckiD93a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Broersma93,
author = {Haitze J. Broersma},
title = {A note on K\({}_{\mbox{4}}\)-closures in hamiltonian graph theory},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {19--23},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90533-Y},
doi = {10.1016/0012-365X(93)90533-Y},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Broersma93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaHV93,
author = {Haitze J. Broersma and
Jan van den Heuvel and
Henk Jan Veldman},
title = {Long cycles, degree sums and neighborhood unions},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {25--35},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90534-Z},
doi = {10.1016/0012-365X(93)90534-Z},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaHV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DeanLS93,
author = {Nathaniel Dean and
Linda M. Lesniak and
Akira Saito},
title = {Cycles of length 0 modulo 4 in graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {37--49},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90535-2},
doi = {10.1016/0012-365X(93)90535-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DeanLS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Dinh93,
author = {Hoa Vu Dinh},
title = {On the length of longest dominating cycles in graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {211--222},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90554-7},
doi = {10.1016/0012-365X(93)90554-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Dinh93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Favaron93,
author = {Odile Favaron},
title = {A note on the irredundance number after vertex deletion},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {51--54},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90536-3},
doi = {10.1016/0012-365X(93)90536-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Favaron93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FavaronMO93,
author = {Odile Favaron and
Pedro Mago and
Oscar Ordaz},
title = {On the bipartite independence number of a balanced bipartite graph},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {55--63},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90537-4},
doi = {10.1016/0012-365X(93)90537-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FavaronMO93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fiedler93,
author = {Miroslav Fiedler},
title = {Some minimax problems for graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {65--74},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90538-5},
doi = {10.1016/0012-365X(93)90538-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fiedler93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fouquet93,
author = {Jean{-}Luc Fouquet},
title = {A decomposition for a class of (P\({}_{\mbox{5}}\), P\({}_{\mbox{5}}\)\({}^{\mbox{{\_}}}\)\({}_{\mbox{5}}\))-free
graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {75--83},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90539-6},
doi = {10.1016/0012-365X(93)90539-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fouquet93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FouquetW93,
author = {Jean{-}Luc Fouquet and
A. Pawel Wojda},
title = {Mutual placement of bipartite graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {85--92},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90540-A},
doi = {10.1016/0012-365X(93)90540-A},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FouquetW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frydrych93,
author = {W. Frydrych},
title = {All nonhamiltonian tough graphs satisfying a 3-degree sum and fan-type
conditions},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {93--104},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90541-Z},
doi = {10.1016/0012-365X(93)90541-Z},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frydrych93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kalinowski93,
author = {Rafal Kalinowski},
title = {Small periods of endomorphisms of trees},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {105--111},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90542-2},
doi = {10.1016/0012-365X(93)90542-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kalinowski93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KatonaQ93,
author = {Gyula O. H. Katona and
Louis V. Quintas},
title = {The largest component in a random subgraph of the n-cycle},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {113--116},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90543-3},
doi = {10.1016/0012-365X(93)90543-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KatonaQ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Konieczna93,
author = {Urzula Konieczna},
title = {Asymptotic normality of subcubes in random subgraphs of the n-cube},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {117--122},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90544-4},
doi = {10.1016/0012-365X(93)90544-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Konieczna93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KonigS93,
author = {Jean{-}Claude K{\"{o}}nig and
Dominique Sotteau},
title = {Symmetric routings of the hypercube},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {123--134},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90545-5},
doi = {10.1016/0012-365X(93)90545-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KonigS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kubale93,
author = {Marek Kubale},
title = {Interval edge coloring of a graph with forbidden colors},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {135--143},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90546-6},
doi = {10.1016/0012-365X(93)90546-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kubale93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kwasnik93,
author = {Maria Kwasnik},
title = {The primitivity of the strong product of two directed graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {145--150},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90547-7},
doi = {10.1016/0012-365X(93)90547-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kwasnik93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lonc93,
author = {Zbigniew Lonc},
title = {Majorization, packing, covering and matroids},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {151--157},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90548-8},
doi = {10.1016/0012-365X(93)90548-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Lonc93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Majcher93,
author = {Zofia Majcher},
title = {Some special realizations of partition matrix sequences},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {159--175},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90549-9},
doi = {10.1016/0012-365X(93)90549-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Majcher93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Nedela93,
author = {Roman Nedela},
title = {Covering spaces of locally homogeneous graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {177--188},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90550-D},
doi = {10.1016/0012-365X(93)90550-D},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Nedela93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Ryjacek93,
author = {Zdenek Ryj{\'{a}}cek},
title = {N\({}_{\mbox{2}}\)-locally disconnected graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {189--193},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90551-4},
doi = {10.1016/0012-365X(93)90551-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Ryjacek93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Schaar93,
author = {G{\"{u}}nter Schaar},
title = {On 'maximal' Hamiltonian cycles in the square of a block},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {195--198},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90552-5},
doi = {10.1016/0012-365X(93)90552-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Schaar93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Topp93,
author = {Jerzy Topp},
title = {Graphs with unique minimum edge dominating sets and graphs with unique
maximum independent sets of vertices},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {199--210},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90553-6},
doi = {10.1016/0012-365X(93)90553-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Topp93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wei93,
author = {Bing Wei},
title = {Hamiltonian paths and hamiltonian connectivity in graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {223--228},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90555-8},
doi = {10.1016/0012-365X(93)90555-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wei93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wozniak93,
author = {Mariusz Wozniak},
title = {A note on minimal order of a bipartite graph with exactly q quadrilaterals},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {229--233},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90556-9},
doi = {10.1016/0012-365X(93)90556-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wozniak93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/X93d,
title = {Preface},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {1},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90530-7},
doi = {10.1016/0012-365X(93)90530-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/X93d.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-04-25 22:41 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:
