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/dm199.bht:"
download as .bib file
@article{DBLP:journals/dm/Bresar99,
author = {Bostjan Bresar},
title = {On clique-gated graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {201--205},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00305-7},
doi = {10.1016/S0012-365X(98)00305-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Bresar99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Britto-Pacumio99,
author = {Ruth A. Britto{-}Pacumio},
title = {Limits of iteratd H-line graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {1--10},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00281-7},
doi = {10.1016/S0012-365X(98)00281-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Britto-Pacumio99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChangDDFKLW99,
author = {Gerard J. Chang and
Bhaskar DasGupta and
Wayne M. Dym{\`{a}}cek and
Martin F{\"{u}}rer and
Matthew Koerlin and
Yueh{-}Shin Lee and
Tom Whaley},
title = {Characterizations of bipartite Steinhaus graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {11--25},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00282-9},
doi = {10.1016/S0012-365X(98)00282-9},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChangDDFKLW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ConfortiCV99,
author = {Michele Conforti and
G{\'{e}}rard Cornu{\'{e}}jols and
Kristina Vuskovic},
title = {Balanced cycles and holes in bipartite graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {27--33},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00283-0},
doi = {10.1016/S0012-365X(98)00283-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ConfortiCV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CsakanyK99,
author = {Rita Cs{\'{a}}k{\'{a}}ny and
J{\'{a}}nos Koml{\'{o}}s},
title = {The smallest Ramsey numbers},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {193--199},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00300-8},
doi = {10.1016/S0012-365X(98)00300-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CsakanyK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DavenR99,
author = {Mike Daven and
C. A. Rodger},
title = {(k, g)-cages are 3-connected},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {207--215},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00342-2},
doi = {10.1016/S0012-365X(98)00342-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DavenR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Dujella99,
author = {Andrej Dujella},
title = {A bijective proof of Riordan's theorem on powers of Fibonacci numbers},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {217--220},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00341-0},
doi = {10.1016/S0012-365X(98)00341-0},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Dujella99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DunbarHHM99,
author = {Jean E. Dunbar and
Stephen T. Hedetniemi and
Michael A. Henning and
Alice A. McRae},
title = {Minus domination in graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {35--47},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00284-2},
doi = {10.1016/S0012-365X(98)00284-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DunbarHHM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FrickeHHHH99,
author = {Gerd Fricke and
Teresa W. Haynes and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Michael A. Henning},
title = {On perfect neighborhood sets in graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {221--225},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00306-9},
doi = {10.1016/S0012-365X(98)00306-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FrickeHHHH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fripertinger99,
author = {Harald Fripertinger},
title = {Enumeration of mosaics},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {49--60},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00285-4},
doi = {10.1016/S0012-365X(98)00285-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fripertinger99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GoddardH99,
author = {Wayne Goddard and
Michael A. Henning},
title = {Real and integer domination in graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {61--75},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00286-6},
doi = {10.1016/S0012-365X(98)00286-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GoddardH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Grabiner99,
author = {David J. Grabiner},
title = {Posets in which every interval is a product of chains, and natural
local actions of the symmetric group},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {77--84},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00287-8},
doi = {10.1016/S0012-365X(98)00287-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Grabiner99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HaggardM99,
author = {Gary Haggard and
Thomas R. Mathies},
title = {The computation of chromatic polynomials},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {227--231},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00343-4},
doi = {10.1016/S0012-365X(98)00343-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HaggardM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HajiabolhassanMTZ99,
author = {Hossein Hajiabolhassan and
Mojtaba L. Mehrabadi and
Ruzbeh Tusserkani and
Manouchehr Zaker},
title = {A characterization of uniquely vertex colorable graphs using minimal
defining sets},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {233--236},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00304-5},
doi = {10.1016/S0012-365X(98)00304-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/HajiabolhassanMTZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Han99,
author = {Han Ren},
title = {Another cycle structure theorem for hamiltonian graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {237--243},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00336-7},
doi = {10.1016/S0012-365X(98)00336-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Han99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HirschhornS99,
author = {Michael D. Hirschhorn and
James A. Sellers},
title = {On representations of a number as a sum of three squares},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {85--101},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00288-X},
doi = {10.1016/S0012-365X(98)00288-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/HirschhornS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Huck99,
author = {Andreas Huck},
title = {Independent branchings in acyclic diagraphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {245--249},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00338-0},
doi = {10.1016/S0012-365X(98)00338-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Huck99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KelmansY99,
author = {Alexander K. Kelmans and
Xuerong Yong},
title = {On the distribution of eigenvalues of graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {251--258},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00337-9},
doi = {10.1016/S0012-365X(98)00337-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KelmansY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Komjath99,
author = {P{\'{e}}ter Komj{\'{a}}th},
title = {Some remarks on universal graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {259--265},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00339-2},
doi = {10.1016/S0012-365X(98)00339-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Komjath99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MazoyerR99,
author = {Jacques Mazoyer and
Ivan Rapaport},
title = {Global fixed point attractors of circular cellular automata and periodic
tilings of the plane: Undecidability results},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {103--122},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00203-9},
doi = {10.1016/S0012-365X(98)00203-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MazoyerR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/McDiarmidR99,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {Colouring proximity graphs in the plane},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {123--137},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00292-1},
doi = {10.1016/S0012-365X(98)00292-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/McDiarmidR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Minoux99,
author = {Michel Minoux},
title = {A generalization of the all minors tree theorem to semirings},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {139--150},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00204-0},
doi = {10.1016/S0012-365X(98)00204-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Minoux99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Schmid99,
author = {J. Schmid},
title = {On maximal sublattices of finite lattices},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {151--159},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00207-6},
doi = {10.1016/S0012-365X(98)00207-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Schmid99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Schroth99,
author = {Andreas E. Schroth},
title = {How to draw a hexagon},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {161--171},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00294-5},
doi = {10.1016/S0012-365X(98)00294-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Schroth99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Treml99,
author = {Miroslav Treml},
title = {Some partitions of positive integers},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {267--271},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00307-0},
doi = {10.1016/S0012-365X(98)00307-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Treml99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Ushio99a,
author = {Kazuhiko Ushio},
title = {Cycle-factorization of symmetric complete multipartite digraphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {273--278},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00302-1},
doi = {10.1016/S0012-365X(98)00302-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Ushio99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Volkmann99,
author = {Lutz Volkmann},
title = {Longest paths in semicomplete multipartite digraphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {279--284},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00301-X},
doi = {10.1016/S0012-365X(98)00301-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Volkmann99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wojcik99,
author = {Piotr W{\'{o}}jcik},
title = {Union-closed families of sets},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {173--182},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00208-8},
doi = {10.1016/S0012-365X(98)00208-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wojcik99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/XuZ99,
author = {Baogen Xu and
Zhongfu Zhang},
title = {On mixed Ramsey numbers},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {285--289},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00303-3},
doi = {10.1016/S0012-365X(98)00303-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/XuZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Zang99,
author = {Wenan Zang},
title = {Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {183--192},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00209-X},
doi = {10.1016/S0012-365X(98)00209-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Zang99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Zhou99,
author = {Sanming Zhou},
title = {A sequential coloring algorithm for finite sets},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {291--297},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00340-9},
doi = {10.1016/S0012-365X(98)00340-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Zhou99.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-25 19:03 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:
