Search dblp for Publications

export results for "toc:db/journals/jgt/jgt35.bht:"

 download as .bib file

@article{DBLP:journals/jgt/AharoniH00,
  author       = {Ron Aharoni and
                  Penny Haxell},
  title        = {Hall's theorem for hypergraphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {2},
  pages        = {83--88},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200010)35:2\<83::AID-JGT2\>3.0.CO;2-V},
  doi          = {10.1002/1097-0118(200010)35:2\<83::AID-JGT2\>3.0.CO;2-V},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AharoniH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/AlonGR00,
  author       = {Noga Alon and
                  Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
                  Mikl{\'{o}}s Ruszink{\'{o}}},
  title        = {Decreasing the diameter of bounded degree graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {3},
  pages        = {161--172},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200011)35:3\<161::AID-JGT1\>3.0.CO;2-Y},
  doi          = {10.1002/1097-0118(200011)35:3\<161::AID-JGT1\>3.0.CO;2-Y},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AlonGR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/AlonKS00,
  author       = {Noga Alon and
                  Michael Krivelevich and
                  Paul D. Seymour},
  title        = {Long cycles in critical graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {3},
  pages        = {193--196},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200011)35:3\<193::AID-JGT4\>3.0.CO;2-G},
  doi          = {10.1002/1097-0118(200011)35:3\<193::AID-JGT4\>3.0.CO;2-G},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AlonKS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BrighamCDFV00,
  author       = {Robert C. Brigham and
                  Julie R. Carrington and
                  Ronald D. Dutton and
                  Joseph Fiedler and
                  Richard P. Vitray},
  title        = {An extremal bandwidth problem for bipartite graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {4},
  pages        = {278--289},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200012)35:4\<278::AID-JGT5\>3.0.CO;2-U},
  doi          = {10.1002/1097-0118(200012)35:4\<278::AID-JGT5\>3.0.CO;2-U},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BrighamCDFV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Diestel00,
  author       = {Reinhard Diestel},
  title        = {An accessibility theorem for infinite graph minors},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {4},
  pages        = {273--277},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200012)35:4\<273::AID-JGT4\>3.0.CO;2-B},
  doi          = {10.1002/1097-0118(200012)35:4\<273::AID-JGT4\>3.0.CO;2-B},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Diestel00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/EichhornMOW00,
  author       = {Dennis Eichhorn and
                  Dhruv Mubayi and
                  Kevin O'Bryant and
                  Douglas B. West},
  title        = {The edge-bandwidth of theta graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {2},
  pages        = {89--98},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200010)35:2\<89::AID-JGT3\>3.0.CO;2-A},
  doi          = {10.1002/1097-0118(200010)35:2\<89::AID-JGT3\>3.0.CO;2-A},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/EichhornMOW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FaudreeFGJL00,
  author       = {Jill R. Faudree and
                  Ralph J. Faudree and
                  Ronald J. Gould and
                  Michael S. Jacobson and
                  Linda M. Lesniak},
  title        = {On \emph{k}-ordered graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {2},
  pages        = {69--82},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200010)35:2\<69::AID-JGT1\>3.0.CO;2-I},
  doi          = {10.1002/1097-0118(200010)35:2\<69::AID-JGT1\>3.0.CO;2-I},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FaudreeFGJL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Galvin00,
  author       = {Fred Galvin},
  title        = {Another note on cliques and independent sets},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {3},
  pages        = {173--175},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200011)35:3\<173::AID-JGT2\>3.0.CO;2-O},
  doi          = {10.1002/1097-0118(200011)35:3\<173::AID-JGT2\>3.0.CO;2-O},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Galvin00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GrahamR000,
  author       = {Ronald L. Graham and
                  Vojtech R{\"{o}}dl and
                  Andrzej Rucinski},
  title        = {On graphs with linear Ramsey numbers},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {3},
  pages        = {176--192},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200011)35:3\<176::AID-JGT3\>3.0.CO;2-C},
  doi          = {10.1002/1097-0118(200011)35:3\<176::AID-JGT3\>3.0.CO;2-C},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/GrahamR000.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Halin00,
  author       = {Rudolf Halin},
  title        = {Miscellaneous problems on infinite graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {2},
  pages        = {128--151},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200010)35:2\<128::AID-JGT6\>3.0.CO;2-6},
  doi          = {10.1002/1097-0118(200010)35:2\<128::AID-JGT6\>3.0.CO;2-6},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Halin00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/HavetT00,
  author       = {Fr{\'{e}}d{\'{e}}ric Havet and
                  St{\'{e}}phan Thomass{\'{e}}},
  title        = {Median orders of tournaments: {A} tool for the second neighborhood
                  problem and Sumner's conjecture},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {4},
  pages        = {244--256},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200012)35:4\<244::AID-JGT2\>3.0.CO;2-H},
  doi          = {10.1002/1097-0118(200012)35:4\<244::AID-JGT2\>3.0.CO;2-H},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/HavetT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Henning00,
  author       = {Michael A. Henning},
  title        = {Graphs with large total domination number},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {1},
  pages        = {21--45},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200009)35:1\<21::AID-JGT3\>3.0.CO;2-F},
  doi          = {10.1002/1097-0118(200009)35:1\<21::AID-JGT3\>3.0.CO;2-F},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Henning00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/JayawardeneR00,
  author       = {Chula J. Jayawardene and
                  Cecil C. Rousseau},
  title        = {The Ramsey number for a cycle of length five vs. a complete graph
                  of order six},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {2},
  pages        = {99--108},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200010)35:2\<99::AID-JGT4\>3.0.CO;2-6},
  doi          = {10.1002/1097-0118(200010)35:2\<99::AID-JGT4\>3.0.CO;2-6},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/JayawardeneR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Johann00,
  author       = {Petra Johann},
  title        = {On the structure of graphs with a unique \emph{k}-factor},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {4},
  pages        = {227--243},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200012)35:4\<227::AID-JGT1\>3.0.CO;2-D},
  doi          = {10.1002/1097-0118(200012)35:4\<227::AID-JGT1\>3.0.CO;2-D},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Johann00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Kelmans00,
  author       = {Alexander K. Kelmans},
  title        = {Crossing properties of graph reliability functions},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {3},
  pages        = {206--221},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200011)35:3\<206::AID-JGT6\>3.0.CO;2-7},
  doi          = {10.1002/1097-0118(200011)35:3\<206::AID-JGT6\>3.0.CO;2-7},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Kelmans00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Li00,
  author       = {Guojun Li},
  title        = {Edge disjoint Hamilton cycles in graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {1},
  pages        = {8--20},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200009)35:1\<8::AID-JGT2\>3.0.CO;2-K},
  doi          = {10.1002/1097-0118(200009)35:1\<8::AID-JGT2\>3.0.CO;2-K},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Li00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Marusic00,
  author       = {Dragan Marusic},
  title        = {Constructing cubic edge- but not vertex-transitive graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {2},
  pages        = {152--160},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200010)35:2\<152::AID-JGT7\>3.0.CO;2-I},
  doi          = {10.1002/1097-0118(200010)35:2\<152::AID-JGT7\>3.0.CO;2-I},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Marusic00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/MarusicP00,
  author       = {Dragan Marusic and
                  Tomaz Pisanski},
  title        = {The Gray graph revisited},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {1},
  pages        = {1--7},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200009)35:1\<1::AID-JGT1\>3.0.CO;2-7},
  doi          = {10.1002/1097-0118(200009)35:1\<1::AID-JGT1\>3.0.CO;2-7},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/MarusicP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/McCuaig00,
  author       = {William McCuaig},
  title        = {Even dicycles},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {1},
  pages        = {46--68},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200009)35:1\<46::AID-JGT4\>3.0.CO;2-W},
  doi          = {10.1002/1097-0118(200009)35:1\<46::AID-JGT4\>3.0.CO;2-W},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/McCuaig00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/McGuinness00,
  author       = {Sean McGuinness},
  title        = {On decomposing a graph into nontrivial bonds},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {2},
  pages        = {109--127},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200010)35:2\<109::AID-JGT5\>3.0.CO;2-8},
  doi          = {10.1002/1097-0118(200010)35:2\<109::AID-JGT5\>3.0.CO;2-8},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/McGuinness00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ProttiS00,
  author       = {F{\'{a}}bio Protti and
                  Jayme Luiz Szwarcfiter},
  title        = {Clique-inverse graphs of \emph{K}\({}_{\mbox{3}}\)-free and \emph{K}\({}_{\mbox{4}}\)-free
                  graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {4},
  pages        = {257--272},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200012)35:4\<257::AID-JGT3\>3.0.CO;2-4},
  doi          = {10.1002/1097-0118(200012)35:4\<257::AID-JGT3\>3.0.CO;2-4},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/ProttiS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Salazar00,
  author       = {Gelasio Salazar},
  title        = {A lower bound for the crossing number of \emph{C\({}_{\mbox{m}}\)
                  {\texttimes} C\({}_{\mbox{n}}\)}},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {3},
  pages        = {222--226},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200011)35:3\<222::AID-JGT7\>3.0.CO;2-E},
  doi          = {10.1002/1097-0118(200011)35:3\<222::AID-JGT7\>3.0.CO;2-E},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Salazar00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/SandersZ00,
  author       = {Daniel P. Sanders and
                  Yue Zhao},
  title        = {Coloring edges of embedded graphs},
  journal      = {J. Graph Theory},
  volume       = {35},
  number       = {3},
  pages        = {197--205},
  year         = {2000},
  url          = {https://doi.org/10.1002/1097-0118(200011)35:3\<197::AID-JGT5\>3.0.CO;2-1},
  doi          = {10.1002/1097-0118(200011)35:3\<197::AID-JGT5\>3.0.CO;2-1},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/SandersZ00.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.