Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dm/CaiCP01,
  author       = {Leizhen Cai and
                  Derek G. Corneil and
                  Andrzej Proskurowski},
  title        = {Stable 2-pairs and (\emph{X, Y})-intersection graphs},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {119--131},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00075-3},
  doi          = {10.1016/S0012-365X(00)00075-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CaiCP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CaiS01,
  author       = {Xiaotao Cai and
                  Warren E. Shreve},
  title        = {Pancyclicity mod \emph{k} of claw-free graphs and \emph{K}\({}_{\mbox{1,
                  4}}\)-free graphs},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {113--118},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00074-1},
  doi          = {10.1016/S0012-365X(00)00074-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CaiS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CatlinHL01,
  author       = {Paul A. Catlin and
                  Arthur M. Hobbs and
                  Hong{-}Jian Lai},
  title        = {Graph family operations},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {71--97},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00071-6},
  doi          = {10.1016/S0012-365X(00)00071-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CatlinHL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ChenLL01,
  author       = {Zhi{-}Hong Chen and
                  Hong{-}Jian Lai and
                  Hongyuan Lai},
  title        = {Nowhere zero flows in line graphs},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {133--141},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00076-5},
  doi          = {10.1016/S0012-365X(00)00076-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ChenLL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/DinneenCF01,
  author       = {Michael J. Dinneen and
                  Kevin Cattell and
                  Michael R. Fellows},
  title        = {Forbidden minors to graphs with small feedback sets},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {215--252},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00083-2},
  doi          = {10.1016/S0012-365X(00)00083-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/DinneenCF01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Fleischner01,
  author       = {Herbert Fleischner},
  title        = {(Some of) the many uses of Eulerian graphs in graph theory (plus some
                  applications)},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {23--43},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00067-4},
  doi          = {10.1016/S0012-365X(00)00067-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Fleischner01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Gould01,
  author       = {Ronald J. Gould},
  title        = {Results on degrees and the structure of 2-factors},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {99--111},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00072-8},
  doi          = {10.1016/S0012-365X(00)00072-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Gould01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/GovindanR01,
  author       = {Rajeev Govindan and
                  Siddharthan Ramachandramurthi},
  title        = {A weak immersion relation on graphs and its applications},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {189--206},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00080-7},
  doi          = {10.1016/S0012-365X(00)00080-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/GovindanR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Harborth01,
  author       = {Heiko Harborth},
  title        = {Eulerian straight ahead cycles in drawings of complete bipartite graphs},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {45--48},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00068-6},
  doi          = {10.1016/S0012-365X(00)00068-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Harborth01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/HobbsL01,
  author       = {Arthur M. Hobbs and
                  Hong{-}Jian Lai},
  title        = {Dedication},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {1},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00356-3},
  doi          = {10.1016/S0012-365X(00)00356-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/HobbsL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/HobbsLR01,
  author       = {Arthur M. Hobbs and
                  Hong{-}Jian Lai and
                  Neil Robertson},
  title        = {Paul Catlin 1948-1995},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {3--12},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00065-0},
  doi          = {10.1016/S0012-365X(00)00065-0},
  timestamp    = {Fri, 27 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/HobbsLR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kelmans01,
  author       = {Alexander K. Kelmans},
  title        = {On graph planarity and semi-duality},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {149--166},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00078-9},
  doi          = {10.1016/S0012-365X(00)00078-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kelmans01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Kelmans01a,
  author       = {Alexander K. Kelmans},
  title        = {On Homotopy of connected graphs having the same degree function},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {167--187},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00079-0},
  doi          = {10.1016/S0012-365X(00)00079-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Kelmans01a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Lai01,
  author       = {Hong{-}Jian Lai},
  title        = {Eulerian subgraphs containing given edges},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {63--69},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00070-4},
  doi          = {10.1016/S0012-365X(00)00070-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Lai01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/LeeRST01,
  author       = {Anna Lee and
                  G{\'{a}}bor R{\'{e}}v{\'{e}}sz and
                  Jen{\"{o}} Szigeti and
                  Zsolt Tuza},
  title        = {Capelli polynomials, almost-permutation matrices and sparse Eulerian
                  graphs},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {49--61},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00069-8},
  doi          = {10.1016/S0012-365X(00)00069-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/LeeRST01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Palmer01,
  author       = {Edgar M. Palmer},
  title        = {On the spanning tree packing number of a graph: a survey},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {13--21},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00066-2},
  doi          = {10.1016/S0012-365X(00)00066-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Palmer01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/RobertsonZ01,
  author       = {Neil Robertson and
                  Xiaoya Zha},
  title        = {Closed 2-cell embeddings of graphs with no \emph{V}\({}_{\mbox{8}}\)-minors},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {207--213},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00081-9},
  doi          = {10.1016/S0012-365X(00)00081-9},
  timestamp    = {Fri, 27 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/RobertsonZ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Spencer01,
  author       = {J. J. Spencer},
  title        = {The question of the collapsibility of random 3-regular graphs},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {253},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00084-4},
  doi          = {10.1016/S0012-365X(00)00084-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Spencer01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Zhang01,
  author       = {Cun{-}Quan Zhang},
  title        = {On strong 1-factors and Hamilton weights of cubic graphs},
  journal      = {Discret. Math.},
  volume       = {230},
  number       = {1-3},
  pages        = {143--148},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00077-7},
  doi          = {10.1016/S0012-365X(00)00077-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Zhang01.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.