Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jgt/AldredP11,
  author       = {Robert E. L. Aldred and
                  Michael D. Plummer},
  title        = {Proximity thresholds for matching extension in planar and projective
                  planar triangulations},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {1},
  pages        = {38--46},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20511},
  doi          = {10.1002/JGT.20511},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AldredP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Bahls11,
  author       = {Patrick Bahls},
  title        = {Channel assignment on Cayley graphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {3},
  pages        = {169--177},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20523},
  doi          = {10.1002/JGT.20523},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Bahls11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BondyM11,
  author       = {J. Adrian Bondy and
                  F. Mercier},
  title        = {Switching reconstruction of digraphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {4},
  pages        = {332--348},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20535},
  doi          = {10.1002/JGT.20535},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BondyM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BorodinI11,
  author       = {Oleg V. Borodin and
                  Anna O. Ivanova},
  title        = {List strong linear 2-arboricity of sparse graphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {2},
  pages        = {83--90},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20516},
  doi          = {10.1002/JGT.20516},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BorodinI11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BowlerBFM11,
  author       = {Andrew Bowler and
                  Paul Brown and
                  Trevor I. Fenner and
                  Wendy J. Myrvold},
  title        = {Recognizing connectedness from vertex-deleted subgraphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {4},
  pages        = {285--299},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20531},
  doi          = {10.1002/JGT.20531},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BowlerBFM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CerecedaHJ11,
  author       = {Luis Cereceda and
                  Jan van den Heuvel and
                  Matthew Johnson},
  title        = {Finding paths between 3-colorings},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {1},
  pages        = {69--82},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20514},
  doi          = {10.1002/JGT.20514},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CerecedaHJ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ChakrabartiK11,
  author       = {Amit Chakrabarti and
                  Subhash Khot},
  title        = {Combinatorial theorems about embedding trees on the real line},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {2},
  pages        = {153--168},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20608},
  doi          = {10.1002/JGT.20608},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/ChakrabartiK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Chen11,
  author       = {Ya{-}Chen Chen},
  title        = {All minimum \emph{C}\({}_{\mbox{5}}\)-saturated graphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {1},
  pages        = {9--26},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20508},
  doi          = {10.1002/JGT.20508},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Chen11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CutlerR11,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {Extremal graphs for homomorphisms},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {4},
  pages        = {261--284},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20530},
  doi          = {10.1002/JGT.20530},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CutlerR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/DellamonicaKMR11,
  author       = {Domingos Dellamonica Jr. and
                  V{\'{a}}clav Koubek and
                  Daniel M. Martin and
                  Vojtech R{\"{o}}dl},
  title        = {On a conjecture of Thomassen concerning subgraphs of large girth},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {4},
  pages        = {316--331},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20534},
  doi          = {10.1002/JGT.20534},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/DellamonicaKMR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GravinC11,
  author       = {Nick Gravin and
                  Ning Chen},
  title        = {A note on \emph{k}-shortest paths problem},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {1},
  pages        = {34--37},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20510},
  doi          = {10.1002/JGT.20510},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/GravinC11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/HamidouneLL11,
  author       = {Yahya Ould Hamidoune and
                  Anna S. Llad{\'{o}} and
                  Susana{-}Clara L{\'{o}}pez},
  title        = {Vertex-transitive graphs that remain connected after failure of a
                  vertex and its neighbors},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {2},
  pages        = {124--138},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20521},
  doi          = {10.1002/JGT.20521},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/HamidouneLL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/HarantJM11,
  author       = {Jochen Harant and
                  Stanislav Jendrol' and
                  Tom{\'{a}}s Madaras},
  title        = {Upper bounds on the sum of powers of the degrees of a simple planar
                  graph},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {2},
  pages        = {112--123},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20519},
  doi          = {10.1002/JGT.20519},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/HarantJM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Jiang11,
  author       = {Tao Jiang},
  title        = {Compact topological minors in graphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {2},
  pages        = {139--152},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20522},
  doi          = {10.1002/JGT.20522},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Jiang11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KawarabayashiO11,
  author       = {Ken{-}ichi Kawarabayashi and
                  Kenta Ozeki},
  title        = {2- and 3-factors of graphs on surfaces},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {4},
  pages        = {306--315},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20533},
  doi          = {10.1002/JGT.20533},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KawarabayashiO11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/King11,
  author       = {Andrew D. King},
  title        = {Hitting all maximum cliques with a stable set using lopsided independent
                  transversals},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {4},
  pages        = {300--305},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20532},
  doi          = {10.1002/JGT.20532},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/King11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KorpelainenL11,
  author       = {Nicholas Korpelainen and
                  Vadim V. Lozin},
  title        = {Bipartite induced subgraphs and well-quasi-ordering},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {3},
  pages        = {235--249},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20528},
  doi          = {10.1002/JGT.20528},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KorpelainenL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/LinL11,
  author       = {Qizhong Lin and
                  Yusheng Li},
  title        = {Multicolor bipartite Ramsey number of \emph{C}\({}_{\mbox{4}}\) and
                  large \emph{K}\({}_{\mbox{\emph{n, n}}}\)},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {1},
  pages        = {47--54},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20512},
  doi          = {10.1002/JGT.20512},
  timestamp    = {Wed, 05 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/LinL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/LiuNPZ11,
  author       = {Daphne Der{-}Fen Liu and
                  Serguei Norine and
                  Zhishi Pan and
                  Xuding Zhu},
  title        = {Circular consecutive choosability of \emph{k}-choosable graphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {3},
  pages        = {178--197},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20524},
  doi          = {10.1002/JGT.20524},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/LiuNPZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Lo11,
  author       = {Allan Siu Lun Lo},
  title        = {Constrained Ramsey numbers for rainbow matching},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {2},
  pages        = {91--95},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20517},
  doi          = {10.1002/JGT.20517},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Lo11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/LowensteinPRR11,
  author       = {Christian L{\"{o}}wenstein and
                  Anders Sune Pedersen and
                  Dieter Rautenbach and
                  Friedrich Regen},
  title        = {Independence, odd girth, and average degree},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {2},
  pages        = {96--111},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20518},
  doi          = {10.1002/JGT.20518},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/LowensteinPRR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Moffatt11,
  author       = {Iain Moffatt},
  title        = {A characterization of partially dual graphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {3},
  pages        = {198--217},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20525},
  doi          = {10.1002/JGT.20525},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Moffatt11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/MoharV11,
  author       = {Bojan Mohar and
                  Andrej Vodopivec},
  title        = {The genus of Petersen powers},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {1},
  pages        = {1--8},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20507},
  doi          = {10.1002/JGT.20507},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/MoharV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/OtaPS11,
  author       = {Katsuhiro Ota and
                  Michael D. Plummer and
                  Akira Saito},
  title        = {Forbidden triples for perfect matchings},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {3},
  pages        = {250--259},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20529},
  doi          = {10.1002/JGT.20529},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/OtaPS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Shabanov11,
  author       = {Dmitry A. Shabanov},
  title        = {On a generalization of Rubin's theorem},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {3},
  pages        = {226--234},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20527},
  doi          = {10.1002/JGT.20527},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Shabanov11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Vijayakumar11,
  author       = {Gurusamy Rengasamy Vijayakumar},
  title        = {Equivalence of four descriptions of generalized line graphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {1},
  pages        = {27--33},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20509},
  doi          = {10.1002/JGT.20509},
  timestamp    = {Mon, 30 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Vijayakumar11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/WienerA11,
  author       = {G{\'{a}}bor Wiener and
                  Makoto Araya},
  title        = {On planar hypohamiltonian graphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {1},
  pages        = {55--68},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20513},
  doi          = {10.1002/JGT.20513},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/WienerA11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Zhang11a,
  author       = {Huajun Zhang},
  title        = {Primitivity and independent sets in direct products of vertex-transitive
                  graphs},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {3},
  pages        = {218--225},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20526},
  doi          = {10.1002/JGT.20526},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Zhang11a.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.