Search dblp for Publications

export results for "toc:db/journals/dm/dm186.bht:"

 download as .bib file

@article{DBLP:journals/dm/BalakrishnanP98,
  author       = {R. Balakrishnan and
                  P. Paulraja},
  title        = {Hamilton cycles in tensor product of graphs},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {1--13},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00215-X},
  doi          = {10.1016/S0012-365X(97)00215-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BalakrishnanP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BalakrishnanSY98,
  author       = {R. Balakrishnan and
                  R. Sampathkumar and
                  V. Yegnanarayanan},
  title        = {Extremal graphs in some coloring problems},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {15--24},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00216-1},
  doi          = {10.1016/S0012-365X(97)00216-1},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/BalakrishnanSY98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BevisG98,
  author       = {Jean Bevis and
                  Michael Grady},
  title        = {Toroidal maps of modular quotient groups},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {25--38},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00222-7},
  doi          = {10.1016/S0012-365X(97)00222-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BevisG98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Bhave98,
  author       = {N. S. Bhave},
  title        = {Characterisation of potentially generalised bipartite self-complementary
                  bi-graphic sequences},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {39--54},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00223-9},
  doi          = {10.1016/S0012-365X(97)00223-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Bhave98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BollobasS98,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Tam{\'{a}}s Szab{\'{o}}},
  title        = {The oriented cycle game},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {55--67},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00224-0},
  doi          = {10.1016/S0012-365X(97)00224-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BollobasS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Borodin98,
  author       = {Oleg V. Borodin},
  title        = {Triangulated 3-polytopes without faces of low weight},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {281--285},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00240-9},
  doi          = {10.1016/S0012-365X(97)00240-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Borodin98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Brandstadt98,
  author       = {Andreas Brandst{\"{a}}dt},
  title        = {Corrigendum},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {295},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(98)00014-4},
  doi          = {10.1016/S0012-365X(98)00014-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Brandstadt98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BuekenhoutP98,
  author       = {Francis Buekenhout and
                  Monique Parker},
  title        = {The number of nets of the regular convex polytopes in dimension {\textless}=
                  4},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {69--94},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00225-2},
  doi          = {10.1016/S0012-365X(97)00225-2},
  timestamp    = {Fri, 19 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/BuekenhoutP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Chen98b,
  author       = {Ciping Chen},
  title        = {Matchings and matching extensions in graphs},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {95--103},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00182-9},
  doi          = {10.1016/S0012-365X(97)00182-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Chen98b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Chen98c,
  author       = {Yong{-}Gao Chen},
  title        = {A theorem on harmonic sequences},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {287--288},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00241-0},
  doi          = {10.1016/S0012-365X(97)00241-0},
  timestamp    = {Tue, 30 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/Chen98c.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ForbesY98,
  author       = {Florence Forbes and
                  Bernard Ycart},
  title        = {Counting stable sets on Cartesian products of graphs},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {105--116},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00185-4},
  doi          = {10.1016/S0012-365X(97)00185-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ForbesY98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Gangopadhyay98,
  author       = {T. Gangopadhyay},
  title        = {Packing graphs in their complements},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {117--124},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00186-6},
  doi          = {10.1016/S0012-365X(97)00186-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Gangopadhyay98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Gill98,
  author       = {Robert Gill},
  title        = {The number of elements in a generalized partition semilattice},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {125--134},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00187-8},
  doi          = {10.1016/S0012-365X(97)00187-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Gill98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Greco98,
  author       = {G. Greco},
  title        = {Capacities of graphs and 2-matchings},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {135--143},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00188-X},
  doi          = {10.1016/S0012-365X(97)00188-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Greco98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Gutin98,
  author       = {Gregory Z. Gutin},
  title        = {A note on the cardinality of certain classes of unlabeled multipartite
                  tournaments},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {277--280},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(98)00013-2},
  doi          = {10.1016/S0012-365X(98)00013-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Gutin98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Henning98,
  author       = {Michael A. Henning},
  title        = {Packing in trees},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {145--155},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00228-8},
  doi          = {10.1016/S0012-365X(97)00228-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Henning98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Jin98,
  author       = {Guoping Jin},
  title        = {The number of complete subgraphs of equi-partite graphs},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {157--165},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00190-8},
  doi          = {10.1016/S0012-365X(97)00190-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Jin98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KlabjanM98,
  author       = {Diego Klabjan and
                  Bojan Mohar},
  title        = {The number of matchings of low order in hexagonal systems},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {167--175},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00163-5},
  doi          = {10.1016/S0012-365X(97)00163-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KlabjanM98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KlugermanRS98,
  author       = {Michael Klugerman and
                  Alexander Russell and
                  Ravi Sundaram},
  title        = {On embedding complete graphs into hypercubes},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {289--293},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00239-2},
  doi          = {10.1016/S0012-365X(97)00239-2},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KlugermanRS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kotani98,
  author       = {Keiko Kotani},
  title        = {K-regular factors and semi-k-regular factors in graphs},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {177--193},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00191-X},
  doi          = {10.1016/S0012-365X(97)00191-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kotani98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Lamken98,
  author       = {Esther R. Lamken},
  title        = {The existence of KS\({}_{\mbox{3}}\)(v; 2, 4)},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {195--216},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00192-1},
  doi          = {10.1016/S0012-365X(97)00192-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Lamken98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/LindquesterW98,
  author       = {Terri Lindquester and
                  Nicholas C. Wormald},
  title        = {Factorisation of regular graphs into forests of short paths},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {217--226},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00193-3},
  doi          = {10.1016/S0012-365X(97)00193-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/LindquesterW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/LukacsS98,
  author       = {Andr{\'{a}}s Luk{\'{a}}cs and
                  Norbert Seifter},
  title        = {Lattices in graphs with polynomial growth},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {227--236},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00194-5},
  doi          = {10.1016/S0012-365X(97)00194-5},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/LukacsS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Morgan98,
  author       = {Ilene H. Morgan},
  title        = {Construction of complete sets of mutually equiorthogonal frequency
                  hypercubes},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {237--251},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00195-7},
  doi          = {10.1016/S0012-365X(97)00195-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Morgan98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/NeufeldN98,
  author       = {S. Neufeld and
                  Richard J. Nowakowski},
  title        = {A game of cops and robbers played on products of graphs},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {253--268},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00165-9},
  doi          = {10.1016/S0012-365X(97)00165-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/NeufeldN98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/SeseljaT98,
  author       = {Branimir Seselja and
                  Andreja Tepavcevic},
  title        = {On generation of finite posets by meet-irreducibles},
  journal      = {Discret. Math.},
  volume       = {186},
  number       = {1-3},
  pages        = {269--275},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00196-9},
  doi          = {10.1016/S0012-365X(97)00196-9},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/SeseljaT98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.