Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jgt/AlbertsonB06,
  author       = {Michael O. Albertson and
                  Debra L. Boutin},
  title        = {Distinguishing geometric graphs},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {2},
  pages        = {135--150},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20171},
  doi          = {10.1002/JGT.20171},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AlbertsonB06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/AlonRSV06,
  author       = {Noga Alon and
                  Rados Radoicic and
                  Benny Sudakov and
                  Jan Vondr{\'{a}}k},
  title        = {A Ramsey-type result for the hypercube},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {3},
  pages        = {196--208},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20181},
  doi          = {10.1002/JGT.20181},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AlonRSV06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BessyHB06,
  author       = {St{\'{e}}phane Bessy and
                  Fr{\'{e}}d{\'{e}}ric Havet and
                  Etienne Birmel{\'{e}}},
  title        = {Arc-chromatic number of digraphs in which every vertex has bounded
                  outdegree or bounded indegree},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {4},
  pages        = {315--332},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20189},
  doi          = {10.1002/JGT.20189},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BessyHB06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BorosEG06,
  author       = {Endre Boros and
                  Khaled M. Elbassioni and
                  Vladimir Gurvich},
  title        = {Transversal hypergraphs to perfect matchings in bipartite graphs:
                  Characterization and generation algorithms},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {3},
  pages        = {209--232},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20180},
  doi          = {10.1002/JGT.20180},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BorosEG06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/BuschJR06,
  author       = {Arthur H. Busch and
                  Michael S. Jacobson and
                  K. Brooks Reid},
  title        = {On arc-traceable tournaments},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {2},
  pages        = {157--166},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20173},
  doi          = {10.1002/JGT.20173},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BuschJR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ChenSW06,
  author       = {Guantao Chen and
                  Warren E. Shreve and
                  Bing Wei},
  title        = {Hamiltonian graphs involving neighborhood unions},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {2},
  pages        = {83--100},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20168},
  doi          = {10.1002/JGT.20168},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/ChenSW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Chudnovsky06,
  author       = {Maria Chudnovsky},
  title        = {Berge trigraphs},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {1},
  pages        = {1--55},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20165},
  doi          = {10.1002/JGT.20165},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Chudnovsky06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Defossez06,
  author       = {David D{\'{e}}fossez},
  title        = {Clique-coloring some classes of odd-hole-free graphs},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {3},
  pages        = {233--249},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20177},
  doi          = {10.1002/JGT.20177},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Defossez06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/FengGGGJR06,
  author       = {Jinfeng Feng and
                  Hans{-}Erik Giesen and
                  Yubao Guo and
                  Gregory Z. Gutin and
                  Tommy R. Jensen and
                  Arash Rafiey},
  title        = {Characterization of edge-colored complete graphs with properly colored
                  Hamilton paths},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {4},
  pages        = {333--346},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20188},
  doi          = {10.1002/JGT.20188},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/FengGGGJR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/GerkeGW06,
  author       = {Stefanie Gerke and
                  Catherine S. Greenhill and
                  Nicholas C. Wormald},
  title        = {The generalized acyclic edge chromatic number of random regular graphs},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {2},
  pages        = {101--125},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20167},
  doi          = {10.1002/JGT.20167},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/GerkeGW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/ImrichK06,
  author       = {Wilfried Imrich and
                  Sandi Klavzar},
  title        = {Distinguishing Cartesian powers of graphs},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {3},
  pages        = {250--260},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20190},
  doi          = {10.1002/JGT.20190},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/ImrichK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/LomeliS06,
  author       = {Mario Lomel{\'{\i}}{-}Haro and
                  Gelasio Salazar},
  title        = {Nearly light cycles in embedded graphs and crossing-critical graphs},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {2},
  pages        = {151--156},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20172},
  doi          = {10.1002/JGT.20172},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/LomeliS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Matrai06,
  author       = {Tam{\'{a}}s M{\'{a}}trai},
  title        = {Covering the edges of a graph by three odd subgraphs},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {1},
  pages        = {77--82},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20170},
  doi          = {10.1002/JGT.20170},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Matrai06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/RodlS06,
  author       = {Vojtech R{\"{o}}dl and
                  Mark H. Siggers},
  title        = {Color critical hypergraphs with many edges},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {1},
  pages        = {56--74},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20166},
  doi          = {10.1002/JGT.20166},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/RodlS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/SaganV06,
  author       = {Bruce E. Sagan and
                  Vincent R. Vatter},
  title        = {Maximal and maximum independent sets in graphs with at most \emph{r}
                  cycles},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {4},
  pages        = {283--314},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20186},
  doi          = {10.1002/JGT.20186},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/SaganV06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Thomassen06a,
  author       = {Carsten Thomassen},
  title        = {On the max-cut problem for a planar, cubic, triangle-free graph, and
                  the Chinese postman problem for a planar triangulation},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {4},
  pages        = {261--269},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20178},
  doi          = {10.1002/JGT.20178},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Thomassen06a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Wood06,
  author       = {David R. Wood},
  title        = {Vertex partitions of chordal graphs},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {2},
  pages        = {167--172},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20183},
  doi          = {10.1002/JGT.20183},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Wood06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/YingMSV06,
  author       = {Goh Chee Ying and
                  Khee Meng Koh and
                  Bruce E. Sagan and
                  Vincent R. Vatter},
  title        = {Maximal independent sets in graphs with at most \emph{r} cycles},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {4},
  pages        = {270--282},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20185},
  doi          = {10.1002/JGT.20185},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/YingMSV06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Yu06a,
  author       = {Xingxing Yu},
  title        = {Infinite paths in planar graphs IV, dividing cycles},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {3},
  pages        = {173--195},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20176},
  doi          = {10.1002/JGT.20176},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Yu06a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/Yuster06,
  author       = {Raphael Yuster},
  title        = {Mean Ramsey-Tur{\'{a}}n numbers},
  journal      = {J. Graph Theory},
  volume       = {53},
  number       = {2},
  pages        = {126--134},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20174},
  doi          = {10.1002/JGT.20174},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Yuster06.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.