Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jgt/AlonEGM02,
  author       = {Noga Alon and
                  Paul Erd{\"{o}}s and
                  David S. Gunderson and
                  Michael Molloy},
  title        = {A Ramsey-type problem and the Tur{\'{a}}n numbers},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {2},
  pages        = {120--129},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10032},
  doi          = {10.1002/JGT.10032},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/AlonEGM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Bang-JensenH02,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Jing Huang},
  title        = {Convex-round graphs are circular-perfect},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {3},
  pages        = {182--194},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10047},
  doi          = {10.1002/JGT.10047},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Bang-JensenH02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BorodinFKRS02,
  author       = {Oleg V. Borodin and
                  Dmitry Fon{-}Der{-}Flaass and
                  Alexandr V. Kostochka and
                  Andr{\'{e}} Raspaud and
                  {\'{E}}ric Sopena},
  title        = {Acyclic list 7-coloring of planar graphs},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {2},
  pages        = {83--90},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10035},
  doi          = {10.1002/JGT.10035},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BorodinFKRS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BresarIKMS02,
  author       = {Bostjan Bresar and
                  Wilfried Imrich and
                  Sandi Klavzar and
                  Henry Martyn Mulder and
                  Riste Skrekovski},
  title        = {Tiled partial cubes},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {2},
  pages        = {91--103},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10031},
  doi          = {10.1002/JGT.10031},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BresarIKMS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BroersmaFHTV02,
  author       = {Hajo Broersma and
                  Ralph J. Faudree and
                  Andreas Huck and
                  Huib Trommel and
                  Henk Jan Veldman},
  title        = {Forbidden subgraphs that imply hamiltonian-connectedness},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {2},
  pages        = {104--119},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10034},
  doi          = {10.1002/JGT.10034},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BroersmaFHTV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ConfortiCKV02,
  author       = {Michele Conforti and
                  G{\'{e}}rard Cornu{\'{e}}jols and
                  Ajai Kapoor and
                  Kristina Vuskovic},
  title        = {Even-hole-free graphs part {II:} Recognition algorithm},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {4},
  pages        = {238--266},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10045},
  doi          = {10.1002/JGT.10045},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/ConfortiCKV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FengL02,
  author       = {Haodi Feng and
                  Guizhen Liu},
  title        = {Orthogonal factorizations of graphs},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {4},
  pages        = {267--276},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10048},
  doi          = {10.1002/JGT.10048},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FengL02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FurediK02,
  author       = {Zolt{\'{a}}n F{\"{u}}redi and
                  Andr{\'{e}} K{\"{u}}ndgen},
  title        = {Tur{\'{a}}n problems for integer-weighted graphs},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {4},
  pages        = {195--225},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10012},
  doi          = {10.1002/JGT.10012},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FurediK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FurediR02,
  author       = {Zolt{\'{a}}n F{\"{u}}redi and
                  Radhika Ramamurthi},
  title        = {On splittable colorings of graphs and hypergraphs},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {4},
  pages        = {226--237},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10044},
  doi          = {10.1002/JGT.10044},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FurediR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GarciaHHNT02,
  author       = {Alfredo Garc{\'{\i}}a Olaverri and
                  M. Carmen Hernando and
                  Ferran Hurtado and
                  Marc Noy and
                  Javier Tejel},
  title        = {Packing trees into planar graphs},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {3},
  pages        = {172--181},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10042},
  doi          = {10.1002/JGT.10042},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/GarciaHHNT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GoddardH02,
  author       = {Wayne Goddard and
                  Michael A. Henning},
  title        = {Domination in planar graphs with small diameter},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {1},
  pages        = {1--25},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10027},
  doi          = {10.1002/JGT.10027},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/GoddardH02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KawarabayashiOS02,
  author       = {Ken{-}ichi Kawarabayashi and
                  Katsuhiro Ota and
                  Akira Saito},
  title        = {Hamiltonian cycles in \emph{n}-extendable graphs},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {2},
  pages        = {75--82},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10050},
  doi          = {10.1002/JGT.10050},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KawarabayashiOS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Kochol02,
  author       = {Martin Kochol},
  title        = {Tension polynomials of graphs},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {3},
  pages        = {137--146},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10038},
  doi          = {10.1002/JGT.10038},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Kochol02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KostochkaW02,
  author       = {Alexandr V. Kostochka and
                  Douglas R. Woodall},
  title        = {Total choosability of multicircuits {I}},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {1},
  pages        = {26--43},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10029},
  doi          = {10.1002/JGT.10029},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KostochkaW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KostochkaW02a,
  author       = {Alexandr V. Kostochka and
                  Douglas R. Woodall},
  title        = {Total choosability of multicircuits {II}},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {1},
  pages        = {44--67},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10030},
  doi          = {10.1002/JGT.10030},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/KostochkaW02a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/KundgenM02,
  author       = {Andr{\'{e}} K{\"{u}}ndgen and
                  Michael Molloy},
  title        = {Extremal problems for chromatic neighborhood sets},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {1},
  pages        = {68--74},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10036},
  doi          = {10.1002/JGT.10036},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/KundgenM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/LaroseT02,
  author       = {Beno{\^{\i}}t Larose and
                  Claude Tardif},
  title        = {Projectivity and independent sets in powers of graphs},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {3},
  pages        = {162--171},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10041},
  doi          = {10.1002/JGT.10041},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/LaroseT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Ohba02,
  author       = {Kyoji Ohba},
  title        = {On chromatic-choosable graphs},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {2},
  pages        = {130--135},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10033},
  doi          = {10.1002/JGT.10033},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Ohba02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Zhang02,
  author       = {Cun{-}Quan Zhang},
  title        = {Circular flows of nearly Eulerian graphs and vertex-splitting},
  journal      = {J. Graph Theory},
  volume       = {40},
  number       = {3},
  pages        = {147--161},
  year         = {2002},
  url          = {https://doi.org/10.1002/jgt.10040},
  doi          = {10.1002/JGT.10040},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Zhang02.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.