Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dm/AcharyaG99a,
  author       = {B. Devadas Acharya and
                  Purnima Gupta},
  title        = {On point-set domination in graphs {IV:} Separable graphs with unique
                  minimum psd-sets},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {1--13},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00160-5},
  doi          = {10.1016/S0012-365X(98)00160-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AcharyaG99a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Ageev99,
  author       = {Alexander A. Ageev},
  title        = {Every circle graph of girth at least 5 is 3-colourable},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {229--233},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00192-7},
  doi          = {10.1016/S0012-365X(98)00192-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Ageev99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/AssafW99,
  author       = {Ahmed M. Assaf and
                  Ruizhong Wei},
  title        = {Modified group divisible designs with block size 4 and lambda = 1},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {15--25},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00161-7},
  doi          = {10.1016/S0012-365X(98)00161-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AssafW99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/AtkinsSS99,
  author       = {Aron C. Atkins and
                  G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
                  Stanley M. Selkow},
  title        = {Counting irregular multigraphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {235--237},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00190-3},
  doi          = {10.1016/S0012-365X(98)00190-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AtkinsSS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Atkinson99,
  author       = {M. D. Atkinson},
  title        = {Restricted permutations},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {27--38},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00162-9},
  doi          = {10.1016/S0012-365X(98)00162-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Atkinson99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Balbuena99,
  author       = {Camino Balbuena},
  title        = {Extraconnectivity of s-geodetic digraphs and graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {39--52},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00163-0},
  doi          = {10.1016/S0012-365X(98)00163-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Balbuena99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BarnetteG99,
  author       = {David W. Barnette and
                  Shelley Gillett},
  title        = {Paths and circuits in partially directed graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {239--243},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00185-X},
  doi          = {10.1016/S0012-365X(98)00185-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BarnetteG99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BeasleyMP99,
  author       = {LeRoy B. Beasley and
                  Sylvia D. Monson and
                  Norman J. Pullman},
  title        = {Linear operators that strongly preserve graphical properties of matrices
                  - {II}},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {53--66},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00164-2},
  doi          = {10.1016/S0012-365X(98)00164-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BeasleyMP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BollobasRRSS99,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Oliver Riordan and
                  Zdenek Ryj{\'{a}}cek and
                  Akira Saito and
                  Richard H. Schelp},
  title        = {Closure and Hamiltonian-connectivity of claw-free graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {67--80},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00165-4},
  doi          = {10.1016/S0012-365X(98)00165-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BollobasRRSS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ChenZ99,
  author       = {Beifang Chen and
                  Sanming Zhou},
  title        = {Domination number and neighbourhood conditions},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {81--91},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00166-6},
  doi          = {10.1016/S0012-365X(98)00166-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ChenZ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Conder99,
  author       = {Marston D. E. Conder},
  title        = {Explicit definition of the binary reflected Gray codes},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {245--249},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00188-5},
  doi          = {10.1016/S0012-365X(98)00188-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Conder99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/DrorFGK99,
  author       = {Moshe Dror and
                  Gerd Finke and
                  Sylvain Gravier and
                  Wieslaw Kubiak},
  title        = {On the complexity of a restricted list-coloring problem},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {103--109},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00169-1},
  doi          = {10.1016/S0012-365X(98)00169-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/DrorFGK99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/FishburnT99,
  author       = {Peter C. Fishburn and
                  William T. Trotter},
  title        = {Split semiorders},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {111--126},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00170-8},
  doi          = {10.1016/S0012-365X(98)00170-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/FishburnT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Gao99,
  author       = {Weidong Gao},
  title        = {On the number of subsequences with given sum},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {127--138},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00121-6},
  doi          = {10.1016/S0012-365X(98)00121-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Gao99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Haxell99,
  author       = {Penny E. Haxell},
  title        = {Packing and covering triangles in graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {251--254},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00183-6},
  doi          = {10.1016/S0012-365X(98)00183-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Haxell99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/HellesethRY99,
  author       = {Tor Helleseth and
                  Chunming Rong and
                  Kyeongcheol Yang},
  title        = {New infinite families of 3-designs from preparata codes over Z\({}_{\mbox{4}}\)},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {139--156},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00123-X},
  doi          = {10.1016/S0012-365X(98)00123-X},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/HellesethRY99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kingan99,
  author       = {Sandra R. Kingan},
  title        = {Intersections of circuits and cocircuits in binary matroids},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {157--165},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00173-3},
  doi          = {10.1016/S0012-365X(98)00173-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kingan99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/LiS99,
  author       = {Jiong{-}Sheng Li and
                  Zi{-}Xia Song},
  title        = {On the potentially P\({}_{\mbox{k}}\)-graphic sequences},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {255--262},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00182-4},
  doi          = {10.1016/S0012-365X(98)00182-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/LiS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Lou99a,
  author       = {Dingjun Lou},
  title        = {A local independence number condition for n-extendable graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {263--268},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00181-2},
  doi          = {10.1016/S0012-365X(98)00181-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Lou99a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/MartiniS99,
  author       = {Horst Martini and
                  Petru Soltan},
  title        = {On convex partitions of polygonal regions},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {167--180},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00125-3},
  doi          = {10.1016/S0012-365X(98)00125-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/MartiniS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/MiaoK99,
  author       = {Ying Miao and
                  Sanpei Kageyama},
  title        = {Two classes of q-ary codes based on group divisible association schemes},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {269--276},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00186-1},
  doi          = {10.1016/S0012-365X(98)00186-1},
  timestamp    = {Tue, 29 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/MiaoK99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/MuthusamyP99,
  author       = {Appu Muthusamy and
                  P. Paulraja},
  title        = {Path factorizations of complete multipartite graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {181--201},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00176-9},
  doi          = {10.1016/S0012-365X(98)00176-9},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/MuthusamyP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Oporowski99,
  author       = {Bogdan Oporowski},
  title        = {Minor-equivalence for infinite graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {203--227},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00126-5},
  doi          = {10.1016/S0012-365X(98)00126-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Oporowski99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Qian99,
  author       = {Jianguo Qian},
  title        = {On the upper bound of the diameter of interchange graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {277--285},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00187-3},
  doi          = {10.1016/S0012-365X(98)00187-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Qian99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/SuttonMRS99,
  author       = {Martin Sutton and
                  Mirka Miller and
                  Joseph F. Ryan and
                  Slamin},
  title        = {Connected graphs which are not mod sum graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {287--293},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00184-8},
  doi          = {10.1016/S0012-365X(98)00184-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/SuttonMRS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/WerraH99,
  author       = {Dominique de Werra and
                  Alain Hertz},
  title        = {On perfectness of sums of graphs},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {93--101},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00168-X},
  doi          = {10.1016/S0012-365X(98)00168-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/WerraH99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ZhangXLL99,
  author       = {Zhongfu Zhang and
                  Baogen Xu and
                  Yinzhen Li and
                  Linzhong Liu},
  title        = {A note on the lower bounds of signed domination number of a graph},
  journal      = {Discret. Math.},
  volume       = {195},
  number       = {1-3},
  pages        = {295--298},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00189-7},
  doi          = {10.1016/S0012-365X(98)00189-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ZhangXLL99.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.