Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dm/AbbasB05,
  author       = {Moncef Abbas and
                  Sadek Bouroubi},
  title        = {On new identities for Bell's polynomials},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {5--10},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.023},
  doi          = {10.1016/J.DISC.2004.08.023},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AbbasB05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/AndersonE05,
  author       = {Ian Anderson and
                  Leigh H. M. Ellison},
  title        = {Z-cyclic ordered triplewhist tournaments on \emph{p} elements, where
                  p=5 (mod 8)},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {11--17},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.025},
  doi          = {10.1016/J.DISC.2004.08.025},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AndersonE05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/AndersonF05,
  author       = {Ian Anderson and
                  Norman J. Finizio},
  title        = {Some new \emph{Z}-cyclic whist tournament designs},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {19--28},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.019},
  doi          = {10.1016/J.DISC.2004.08.019},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AndersonF05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/AndersonP05,
  author       = {Ian Anderson and
                  Donald A. Preece},
  title        = {Some power-sequence terraces for Z\({}_{\mbox{pq}}\) with as few segments
                  as possible},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {29--59},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.020},
  doi          = {10.1016/J.DISC.2004.08.020},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AndersonP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Ando05,
  author       = {Kiyoshi Ando},
  title        = {Trivially noncontractible edges in a contraction critically 5-connected
                  graph},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {61--72},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.021},
  doi          = {10.1016/J.DISC.2004.08.021},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Ando05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Bailey05,
  author       = {Rosemary A. Bailey},
  title        = {Balanced colourings of strongly regular graphs},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {73--90},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.022},
  doi          = {10.1016/J.DISC.2004.08.022},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/Bailey05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Cameron05c,
  author       = {Peter J. Cameron},
  title        = {Research problems from the 19th British Combinatorial Conference},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {313--320},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2005.02.006},
  doi          = {10.1016/J.DISC.2005.02.006},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Cameron05c.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CameronW05,
  author       = {Peter J. Cameron and
                  Ian M. Wanless},
  title        = {Covering radius for sets of permutations},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {91--109},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.024},
  doi          = {10.1016/J.DISC.2004.08.024},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CameronW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/FouchePS05,
  author       = {Willem L. Fouch{\'{e}} and
                  Lourens M. Pretorius and
                  Conrad Johann Swanepoel},
  title        = {Ramsey degrees of bipartite graphs: {A} primitive recursive proof},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {111--119},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.035},
  doi          = {10.1016/J.DISC.2004.08.035},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/FouchePS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/GhandehariHM05,
  author       = {Mahya Ghandehari and
                  Hamed Hatami and
                  Ebadollah S. Mahmoodian},
  title        = {On the size of the minimum critical set of a Latin square},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {121--127},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.026},
  doi          = {10.1016/J.DISC.2004.08.026},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/GhandehariHM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/GoddardHHL05,
  author       = {Wayne Goddard and
                  Sandra Mitchell Hedetniemi and
                  Stephen T. Hedetniemi and
                  Renu C. Laskar},
  title        = {Generalized subgraph-restricted matchings in graphs},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {129--138},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.027},
  doi          = {10.1016/J.DISC.2004.08.027},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/GoddardHHL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/HernandoJMPS05,
  author       = {M. Carmen Hernando and
                  Tao Jiang and
                  Merc{\`{e}} Mora and
                  Ignacio M. Pelayo and
                  Carlos Seara},
  title        = {On the Steiner, geodetic and hull numbers of graphs},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {139--154},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.039},
  doi          = {10.1016/J.DISC.2004.08.039},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/HernandoJMPS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/HolroydST05,
  author       = {Fred C. Holroyd and
                  Claire Spencer and
                  John M. Talbot},
  title        = {Compression and Erd{\"{o}}s-Ko-Rado graphs},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {155--164},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.041},
  doi          = {10.1016/J.DISC.2004.08.041},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/HolroydST05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/HolroydT05,
  author       = {Fred C. Holroyd and
                  John M. Talbot},
  title        = {Graphs with the Erd{\"{o}}s-Ko-Rado property},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {165--176},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.028},
  doi          = {10.1016/J.DISC.2004.08.028},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/HolroydT05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Jorgensen05,
  author       = {Leif K. J{\o}rgensen},
  title        = {Girth 5 graphs from relative difference sets},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {177--184},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.029},
  doi          = {10.1016/J.DISC.2004.08.029},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Jorgensen05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Lichiardopol05,
  author       = {Nicolas Lichiardopol},
  title        = {Independence number of iterated line digraphs},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {185--193},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.030},
  doi          = {10.1016/J.DISC.2004.08.030},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Lichiardopol05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Maruta05,
  author       = {Tatsuya Maruta},
  title        = {Extendability of quaternary linear codes},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {195--203},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.031},
  doi          = {10.1016/J.DISC.2004.08.031},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Maruta05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/MaynardS05,
  author       = {Philip Maynard and
                  Johannes Siemons},
  title        = {Efficient reconstruction of partitions},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {205--211},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.037},
  doi          = {10.1016/J.DISC.2004.08.037},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/MaynardS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/PhillipsPW05,
  author       = {Nicholas C. K. Phillips and
                  Donald A. Preece and
                  Walter D. Wallis},
  title        = {The seven classes of 5{\texttimes}6 triple arrays},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {213--218},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.032},
  doi          = {10.1016/J.DISC.2004.08.032},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/PhillipsPW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/RuizM05,
  author       = {Jos{\'{e}} Luis Ruiz and
                  Merc{\`{e}} Mora},
  title        = {De Bruijn and Kautz digraphs of a rooted tree},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {219--236},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.040},
  doi          = {10.1016/J.DISC.2004.08.040},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/RuizM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/SeyffarthW05,
  author       = {Karen Seyffarth and
                  Chengde Wang},
  title        = {On eulerian and regular perfect path double covers of graphs},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {237--250},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.038},
  doi          = {10.1016/J.DISC.2004.08.038},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/SeyffarthW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Tsaur05,
  author       = {Rueiher Tsaur},
  title        = {The Baillon-Simons theorems},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {251--261},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.034},
  doi          = {10.1016/J.DISC.2004.08.034},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Tsaur05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Walsh05,
  author       = {Timothy R. Walsh},
  title        = {Efficient enumeration of sensed planar maps},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {263--289},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.036},
  doi          = {10.1016/J.DISC.2004.08.036},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Walsh05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Woodall05,
  author       = {Douglas R. Woodall},
  title        = {Preface},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {1},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2005.02.001},
  doi          = {10.1016/J.DISC.2005.02.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Woodall05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/X05,
  title        = {Guest editor listing},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {3},
  year         = {2005},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/X05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ZverovichZ05,
  author       = {Igor E. Zverovich and
                  Vadim E. Zverovich},
  title        = {Basic perfect graphs and their extensions},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {291--311},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.disc.2004.08.033},
  doi          = {10.1016/J.DISC.2004.08.033},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ZverovichZ05.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.