Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jgt/Andreae08,
  author       = {Thomas Andreae},
  title        = {On self-immersions of infinite graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {4},
  pages        = {275--285},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20308},
  doi          = {10.1002/JGT.20308},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Andreae08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/AxenovichKM08,
  author       = {Maria Axenovich and
                  Andr{\'{e}} E. K{\'{e}}zdy and
                  Ryan R. Martin},
  title        = {On the editing distance of graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {2},
  pages        = {123--138},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20296},
  doi          = {10.1002/JGT.20296},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AxenovichKM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Birmele08,
  author       = {Etienne Birmel{\'{e}}},
  title        = {Every longest circuit of a 3-connected, \emph{K}\({}_{\mbox{3, 3}}\)-minor
                  free graph has a chord},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {4},
  pages        = {293--298},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20312},
  doi          = {10.1002/JGT.20312},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Birmele08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BorosGZ08,
  author       = {Endre Boros and
                  Vladimir Gurvich and
                  Igor E. Zverovich},
  title        = {Neighborhood hypergraphs of bipartite graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {1},
  pages        = {69--95},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20293},
  doi          = {10.1002/JGT.20293},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BorosGZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BoseDKLMWW08,
  author       = {Prosenjit Bose and
                  Vida Dujmovic and
                  Danny Krizanc and
                  Stefan Langerman and
                  Pat Morin and
                  David R. Wood and
                  Stefanie Wuhrer},
  title        = {A Characterization of the degree sequences of 2-trees},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {3},
  pages        = {191--209},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20302},
  doi          = {10.1002/JGT.20302},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BoseDKLMWW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BougardJ08,
  author       = {Nicolas Bougard and
                  Gwena{\"{e}}l Joret},
  title        = {Tur{\'{a}}n's theorem and \emph{k}-connected graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {1},
  pages        = {1--13},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20289},
  doi          = {10.1002/JGT.20289},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BougardJ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CariolaroF08,
  author       = {David Cariolaro and
                  Hung{-}Lin Fu},
  title        = {On minimum sets of 1-factors covering a complete multipartite graph},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {3},
  pages        = {239--250},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20303},
  doi          = {10.1002/JGT.20303},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CariolaroF08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CheCT08,
  author       = {Zhongyuan Che and
                  Karen L. Collins and
                  Claude Tardif},
  title        = {Odd-angulated graphs and cancelling factors in box products},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {3},
  pages        = {221--238},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20307},
  doi          = {10.1002/JGT.20307},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CheCT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ChenFLS08,
  author       = {Guantao Chen and
                  Ralph J. Faudree and
                  Xuechao Li and
                  Ingo Schiermeyer},
  title        = {Non-path spectrum sets},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {4},
  pages        = {329--350},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20315},
  doi          = {10.1002/JGT.20315},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/ChenFLS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Chiniforooshan08,
  author       = {Ehsan Chiniforooshan},
  title        = {A better bound for the cop number of general graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {1},
  pages        = {45--48},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20291},
  doi          = {10.1002/JGT.20291},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Chiniforooshan08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Conlon08,
  author       = {David Conlon},
  title        = {A new upper bound for the bipartite Ramsey problem},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {4},
  pages        = {351--356},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20317},
  doi          = {10.1002/JGT.20317},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Conlon08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CucklerL08,
  author       = {Bill Cuckler and
                  Felix Lazebnik},
  title        = {Irregularity strength of dense graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {4},
  pages        = {299--313},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20313},
  doi          = {10.1002/JGT.20313},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CucklerL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FujisawaY08,
  author       = {Jun Fujisawa and
                  Tomoki Yamashita},
  title        = {Cycles passing through \emph{k} + 1 vertices in \emph{k}-connected
                  graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {2},
  pages        = {179--190},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20306},
  doi          = {10.1002/JGT.20306},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FujisawaY08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FujitaK08,
  author       = {Shinya Fujita and
                  Ken{-}ichi Kawarabayashi},
  title        = {Contractible elements in \emph{k}-connected graphs not containing
                  some specified graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {2},
  pages        = {97--109},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20297},
  doi          = {10.1002/JGT.20297},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FujitaK08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GeelenGM08,
  author       = {Jim Geelen and
                  Anjie Guo and
                  David McKinnon},
  title        = {Straight line embeddings of cubic planar graphs with integer edge
                  lengths},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {3},
  pages        = {270--274},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20304},
  doi          = {10.1002/JGT.20304},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/GeelenGM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Haxell08,
  author       = {Penny E. Haxell},
  title        = {An improved bound for the strong chromatic number},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {2},
  pages        = {148--158},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20300},
  doi          = {10.1002/JGT.20300},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Haxell08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/HeardH08,
  author       = {Scott Heard and
                  Jing Huang},
  title        = {Disjoint quasi-kernels in digraphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {3},
  pages        = {251--260},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20310},
  doi          = {10.1002/JGT.20310},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/HeardH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/HeubergerW08,
  author       = {Clemens Heuberger and
                  Stephan G. Wagner},
  title        = {Maximizing the number of independent subsets over trees with bounded
                  degree},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {1},
  pages        = {49--68},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20294},
  doi          = {10.1002/JGT.20294},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/HeubergerW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KostochkaY08,
  author       = {Alexandr V. Kostochka and
                  Gexin Yu},
  title        = {Ore-type degree conditions for a graph to be \emph{H}-linked},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {1},
  pages        = {14--26},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20295},
  doi          = {10.1002/JGT.20295},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KostochkaY08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KralS08,
  author       = {Daniel Kr{\'{a}}l and
                  Ladislav Stacho},
  title        = {Hamiltonian threshold for strong products of graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {4},
  pages        = {314--328},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20314},
  doi          = {10.1002/JGT.20314},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KralS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Norine08,
  author       = {Serguei Norine},
  title        = {On two questions about circular choosability},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {3},
  pages        = {261--269},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20309},
  doi          = {10.1002/JGT.20309},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Norine08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Rautenbach08,
  author       = {Dieter Rautenbach},
  title        = {A conjecture of Borodin and a coloring of Gr{\"{u}}nbaum},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {2},
  pages        = {139--147},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20299},
  doi          = {10.1002/JGT.20299},
  timestamp    = {Sun, 22 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Rautenbach08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Thomassen08,
  author       = {Carsten Thomassen},
  title        = {Decompositions of highly connected graphs into paths of length 3},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {4},
  pages        = {286--292},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20311},
  doi          = {10.1002/JGT.20311},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Thomassen08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/WangL08,
  author       = {Wei{-}Fan Wang and
                  Ko{-}Wei Lih},
  title        = {Coupled choosability of plane graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {1},
  pages        = {27--44},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20292},
  doi          = {10.1002/JGT.20292},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/WangL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Wollan08,
  author       = {Paul Wollan},
  title        = {Extremal functions for rooted minors},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {2},
  pages        = {159--178},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20301},
  doi          = {10.1002/JGT.20301},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Wollan08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/WuW08,
  author       = {Jian{-}Liang Wu and
                  Yu{-}Wen Wu},
  title        = {The linear arboricity of planar graphs of maximum degree seven is
                  four},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {3},
  pages        = {210--220},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20305},
  doi          = {10.1002/JGT.20305},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/WuW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Zaker08,
  author       = {Manouchehr Zaker},
  title        = {New bounds for the chromatic number of graphs},
  journal      = {J. Graph Theory},
  volume       = {58},
  number       = {2},
  pages        = {110--122},
  year         = {2008},
  url          = {https://doi.org/10.1002/jgt.20298},
  doi          = {10.1002/JGT.20298},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Zaker08.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.