Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dm/AcharyaG99,
  author       = {B. Devadas Acharya and
                  Purnima Gupta},
  title        = {Domination in graphoidal covers of a graph},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {3--33},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00389-6},
  doi          = {10.1016/S0012-365X(98)00389-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AcharyaG99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/AldredHPP99,
  author       = {Robert E. L. Aldred and
                  Derek A. Holton and
                  M. I. Porteous and
                  Michael D. Plummer},
  title        = {Two results on matching extensions with prescribed and proscribed
                  edge sets},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {35--43},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00405-1},
  doi          = {10.1016/S0012-365X(98)00405-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AldredHPP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ArumugamJ99,
  author       = {S. Arumugam and
                  J. Paulraj Joseph},
  title        = {On graphs with equal domination and connected domination numbers},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {45--49},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00390-2},
  doi          = {10.1016/S0012-365X(98)00390-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ArumugamJ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BaggaBV99,
  author       = {Jay S. Bagga and
                  Lowell W. Beineke and
                  Badri N. Varma},
  title        = {The super line graph L\({}_{\mbox{2}}\)},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {51--61},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00391-4},
  doi          = {10.1016/S0012-365X(98)00391-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BaggaBV99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BeinekeBH99,
  author       = {Lowell W. Beineke and
                  Izak Broere and
                  Michael A. Henning},
  title        = {Queens graphs},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {63--75},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00392-6},
  doi          = {10.1016/S0012-365X(98)00392-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BeinekeBH99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BorodinKNRS99,
  author       = {Oleg V. Borodin and
                  Alexandr V. Kostochka and
                  Jaroslav Nesetril and
                  Andr{\'{e}} Raspaud and
                  {\'{E}}ric Sopena},
  title        = {On the maximum average degree and the oriented chromatic number of
                  a graph},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {77--89},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00393-8},
  doi          = {10.1016/S0012-365X(98)00393-8},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/BorodinKNRS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ChangatM99,
  author       = {Manoj Changat and
                  Joseph Mathews},
  title        = {On triangle path convexity in graphs},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {91--95},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00394-X},
  doi          = {10.1016/S0012-365X(98)00394-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ChangatM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ChoudumK99,
  author       = {Sheshayya A. Choudum and
                  K. Kayathri},
  title        = {An extension of Vizing's adjacency lemma on edge chromatic critical
                  graphs},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {97--103},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00397-5},
  doi          = {10.1016/S0012-365X(98)00397-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ChoudumK99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ChoudumK99a,
  author       = {Sheshayya A. Choudum and
                  S. Pitchai Muthu Kishore},
  title        = {Graceful labelling of the union of paths and cycles},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {105--117},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00395-1},
  doi          = {10.1016/S0012-365X(98)00395-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ChoudumK99a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ChoudumP99,
  author       = {Sheshayya A. Choudum and
                  B. Ponnusamy},
  title        = {Ramsey numbers for transitive tournaments},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {119--129},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00396-3},
  doi          = {10.1016/S0012-365X(98)00396-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ChoudumP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/DeviV99,
  author       = {N. Usha Devi and
                  Gurusamy Rengasamy Vijayakumar},
  title        = {Hereditary properties of graphs},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {213--215},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00409-9},
  doi          = {10.1016/S0012-365X(98)00409-9},
  timestamp    = {Mon, 30 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/DeviV99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/FaudreeFFLL99,
  author       = {Ralph J. Faudree and
                  Odile Favaron and
                  Evelyne Flandrin and
                  Hao Li and
                  Zhenhong Liu},
  title        = {On 2-factors in claw-free graphs},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {131--137},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00398-7},
  doi          = {10.1016/S0012-365X(98)00398-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/FaudreeFFLL99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/FavaronFLT99,
  author       = {Odile Favaron and
                  Evelyne Flandrin and
                  Hao Li and
                  Feng Tian},
  title        = {An Ore-type condition for pancyclability},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {139--144},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00399-9},
  doi          = {10.1016/S0012-365X(98)00399-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/FavaronFLT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Ferenczi99,
  author       = {S{\'{e}}bastien Ferenczi},
  title        = {Complexity of sequences and dynamical systems},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {145--154},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00400-2},
  doi          = {10.1016/S0012-365X(98)00400-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Ferenczi99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Glynn99,
  author       = {David G. Glynn},
  title        = {The representation of any affine plane of prime-power order within
                  its own line-code},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {155--158},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00401-4},
  doi          = {10.1016/S0012-365X(98)00401-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Glynn99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Owens99,
  author       = {Peter J. Owens},
  title        = {Shortness parameters for polyhedral graphs},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {159--169},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00402-6},
  doi          = {10.1016/S0012-365X(98)00402-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Owens99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Parthasarathy99,
  author       = {K. R. Parthasarathy},
  title        = {Graph characterising polynomials},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {171--178},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00403-8},
  doi          = {10.1016/S0012-365X(98)00403-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Parthasarathy99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ParvathyV99,
  author       = {K. S. Parvathy and
                  Ambat Vijayakumar},
  title        = {Convex extendable trees},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {179--185},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00404-X},
  doi          = {10.1016/S0012-365X(98)00404-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ParvathyV99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Prisner99,
  author       = {Erich Prisner},
  title        = {Generalized octahedra and cliques in intersection graphs of uniform
                  hypergraphs},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {187--195},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00406-3},
  doi          = {10.1016/S0012-365X(98)00406-3},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/Prisner99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Ravindra99,
  author       = {G. Ravindra},
  title        = {Some classes of strongly perfect graphs},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {197--203},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00407-5},
  doi          = {10.1016/S0012-365X(98)00407-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Ravindra99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/SridharanR99,
  author       = {N. Sridharan and
                  G. Ramachandran},
  title        = {Simple graphs containing induced subgraphs whose automorphism groups
                  are isomorphic to subgroups of a given finite group},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {205--212},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00408-7},
  doi          = {10.1016/S0012-365X(98)00408-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/SridharanR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Vijayalakshmi99,
  author       = {V. Vijayalakshmi},
  title        = {Multiplicity of triangles in cocktail party graphs},
  journal      = {Discret. Math.},
  volume       = {206},
  number       = {1-3},
  pages        = {217--218},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00410-5},
  doi          = {10.1016/S0012-365X(98)00410-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Vijayalakshmi99.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.