Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jgt/AldredJ07,
  author       = {Robert E. L. Aldred and
                  Bill Jackson},
  title        = {Edge proximity conditions for extendability in cubic bipartite graphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {2},
  pages        = {112--120},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20226},
  doi          = {10.1002/JGT.20226},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AldredJ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/AlonBGLS07,
  author       = {Noga Alon and
                  B{\'{e}}la Bollob{\'{a}}s and
                  Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
                  Jen{\"{o}} Lehel and
                  Alex D. Scott},
  title        = {Maximum directed cuts in acyclic digraphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {1},
  pages        = {1--13},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20215},
  doi          = {10.1002/JGT.20215},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AlonBGLS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Balacheff07,
  author       = {Florent Balacheff},
  title        = {Volume entropy, weighted girths and stable balls on graphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {4},
  pages        = {291--305},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20236},
  doi          = {10.1002/JGT.20236},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/Balacheff07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BalbuenaJLMM07,
  author       = {Camino Balbuena and
                  T. Jiang and
                  Yuqing Lin and
                  Xavier Marcote and
                  Mirka Miller},
  title        = {A lower bound on the order of regular graphs with given girth pair},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {2},
  pages        = {153--163},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20230},
  doi          = {10.1002/JGT.20230},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BalbuenaJLMM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BauerBMS07,
  author       = {Douglas Bauer and
                  Hajo Broersma and
                  Aurora Morgana and
                  Edward F. Schmeichel},
  title        = {Tutte sets in graphs {I:} Maximal tutte sets and D-graphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {4},
  pages        = {343--358},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20243},
  doi          = {10.1002/JGT.20243},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BauerBMS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BroersmaFGW07,
  author       = {Hajo Broersma and
                  Fedor V. Fomin and
                  Petr A. Golovach and
                  Gerhard J. Woeginger},
  title        = {Backbone colorings for graphs: Tree and path backbones},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {2},
  pages        = {137--152},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20228},
  doi          = {10.1002/JGT.20228},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BroersmaFGW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CaoH07,
  author       = {Weiting Cao and
                  Peter Hamburger},
  title        = {Solution of fink {\&} straight conjecture on path-perfect complete
                  bipartite graphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {2},
  pages        = {91--111},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20225},
  doi          = {10.1002/JGT.20225},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/CaoH07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Chen07,
  author       = {Zhi{-}Zhong Chen},
  title        = {New bounds on the edge number of a \emph{k}-map graph},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {4},
  pages        = {267--290},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20237},
  doi          = {10.1002/JGT.20237},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Chen07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CoudertHS07,
  author       = {David Coudert and
                  Florian Huc and
                  Jean{-}S{\'{e}}bastien Sereni},
  title        = {Pathwidth of outerplanar graphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {1},
  pages        = {27--41},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20218},
  doi          = {10.1002/JGT.20218},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CoudertHS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FidlerY07,
  author       = {Dror Fidler and
                  Raphael Yuster},
  title        = {Remarks on the second neighborhood problem},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {3},
  pages        = {208--220},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20229},
  doi          = {10.1002/JGT.20229},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FidlerY07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FominT07,
  author       = {Fedor V. Fomin and
                  Dimitrios M. Thilikos},
  title        = {On self duality of pathwidth in polyhedral graph embeddings},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {1},
  pages        = {42--54},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20219},
  doi          = {10.1002/JGT.20219},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FominT07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FujisawaXYZ07,
  author       = {Jun Fujisawa and
                  Liming Xiong and
                  Kiyoshi Yoshimoto and
                  Shenggui Zhang},
  title        = {The upper bound of the number of cycles in a 2-factor of a line graph},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {1},
  pages        = {72--82},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20220},
  doi          = {10.1002/JGT.20220},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FujisawaXYZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GyarfasRSS07,
  author       = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and
                  Mikl{\'{o}}s Ruszink{\'{o}} and
                  G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
                  Endre Szemer{\'{e}}di},
  title        = {Tripartite Ramsey numbers for paths},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {2},
  pages        = {164--174},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20231},
  doi          = {10.1002/JGT.20231},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/GyarfasRSS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/JinYZ07,
  author       = {Zemin Jin and
                  Xingxing Yu and
                  Xiaoyan Zhang},
  title        = {Contractible subgraphs in \emph{k}-connected graphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {2},
  pages        = {121--136},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20227},
  doi          = {10.1002/JGT.20227},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/JinYZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/JorgensenK07,
  author       = {Leif K. J{\o}rgensen and
                  Ken{-}ichi Kawarabayashi},
  title        = {Extremal results for rooted minor problems},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {3},
  pages        = {191--207},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20232},
  doi          = {10.1002/JGT.20232},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/JorgensenK07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KanekoKS07,
  author       = {Atsushi Kaneko and
                  Mikio Kano and
                  Kazuhiro Suzuki},
  title        = {Spanning trees with leaf distance at least four},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {1},
  pages        = {83--90},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20221},
  doi          = {10.1002/JGT.20221},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KanekoKS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Kelmans07,
  author       = {Alexander K. Kelmans},
  title        = {Packing \emph{k}-edge trees in graphs of restricted vertex degrees},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {4},
  pages        = {306--324},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20238},
  doi          = {10.1002/JGT.20238},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Kelmans07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Marshall07,
  author       = {T. H. Marshall},
  title        = {Homomorphism bounds for oriented planar graphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {3},
  pages        = {175--190},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20233},
  doi          = {10.1002/JGT.20233},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Marshall07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Matamala07,
  author       = {Mart{\'{\i}}n Matamala},
  title        = {Vertex partitions and maximum degenerate subgraphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {3},
  pages        = {227--232},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20235},
  doi          = {10.1002/JGT.20235},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Matamala07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/MiklavicPW07,
  author       = {Stefko Miklavic and
                  Primoz Potocnik and
                  Steve Wilson},
  title        = {Overlap in consistent cycles},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {1},
  pages        = {55--71},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20224},
  doi          = {10.1002/JGT.20224},
  timestamp    = {Thu, 22 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/MiklavicPW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/RaspaudZ07,
  author       = {Andr{\'{e}} Raspaud and
                  Xuding Zhu},
  title        = {List circular coloring of trees and cycles},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {3},
  pages        = {249--265},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20234},
  doi          = {10.1002/JGT.20234},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/RaspaudZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/SahiliK07,
  author       = {Amine El Sahili and
                  Mekkia Kouider},
  title        = {About paths with two blocks},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {3},
  pages        = {221--226},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20222},
  doi          = {10.1002/JGT.20222},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/SahiliK07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/SiranT07,
  author       = {Jozef Sir{\'{a}}n and
                  Thomas W. Tucker},
  title        = {Characterization of graphs which admit vertex-transitive embeddings},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {3},
  pages        = {233--248},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20239},
  doi          = {10.1002/JGT.20239},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/SiranT07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Soh07,
  author       = {Chin{-}Ann Soh},
  title        = {The circular chromatic numbers of planar digraphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {1},
  pages        = {14--26},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20217},
  doi          = {10.1002/JGT.20217},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Soh07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Yeo07,
  author       = {Anders Yeo},
  title        = {Relationships between total domination, order, size, and maximum degree
                  of graphs},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {4},
  pages        = {325--337},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20240},
  doi          = {10.1002/JGT.20240},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Yeo07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ZamfirescuZ07,
  author       = {Carol T. Zamfirescu and
                  Tudor Zamfirescu},
  title        = {A planar hypohamiltonian graph with 48 vertices},
  journal      = {J. Graph Theory},
  volume       = {55},
  number       = {4},
  pages        = {338--342},
  year         = {2007},
  url          = {https://doi.org/10.1002/jgt.20241},
  doi          = {10.1002/JGT.20241},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/ZamfirescuZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.