default search action
Search dblp for Publications
export results for "toc:db/journals/jgt/jgt65.bht:"
@article{DBLP:journals/jgt/AdigaC10, author = {Abhijin Adiga and L. Sunil Chandran}, title = {Cubicity of interval graphs and the claw number}, journal = {J. Graph Theory}, volume = {65}, number = {4}, pages = {323--333}, year = {2010}, url = {https://doi.org/10.1002/jgt.20483}, doi = {10.1002/JGT.20483}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/AdigaC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Bokal10, author = {Drago Bokal}, title = {Infinite families of crossing-critical graphs with prescribed average degree and crossing number}, journal = {J. Graph Theory}, volume = {65}, number = {2}, pages = {139--162}, year = {2010}, url = {https://doi.org/10.1002/jgt.20470}, doi = {10.1002/JGT.20470}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Bokal10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BonatoHT10, author = {Anthony Bonato and Gena Hahn and Claude Tardif}, title = {Large classes of infinite \emph{k}-cop-win graphs}, journal = {J. Graph Theory}, volume = {65}, number = {4}, pages = {334--342}, year = {2010}, url = {https://doi.org/10.1002/jgt.20484}, doi = {10.1002/JGT.20484}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BonatoHT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BorodinIMOR10, author = {Oleg V. Borodin and Anna O. Ivanova and Micka{\"{e}}l Montassier and Pascal Ochem and Andr{\'{e}} Raspaud}, title = {Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \emph{k}}, journal = {J. Graph Theory}, volume = {65}, number = {2}, pages = {83--93}, year = {2010}, url = {https://doi.org/10.1002/jgt.20467}, doi = {10.1002/JGT.20467}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BorodinIMOR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/CaiWZ10, author = {Leizhen Cai and Weifan Wang and Xuding Zhu}, title = {Choosability of toroidal graphs without short cycles}, journal = {J. Graph Theory}, volume = {65}, number = {1}, pages = {1--15}, year = {2010}, url = {https://doi.org/10.1002/jgt.20460}, doi = {10.1002/JGT.20460}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/CaiWZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/CropperHJL10, author = {Mathew Cropper and Anthony J. W. Hilton and Peter D. Johnson Jr. and Jen{\"{o}} Lehel}, title = {List multicoloring problems involving the \emph{k}-fold Hall numbers}, journal = {J. Graph Theory}, volume = {65}, number = {1}, pages = {16--34}, year = {2010}, url = {https://doi.org/10.1002/jgt.20462}, doi = {10.1002/JGT.20462}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/CropperHJL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Diwan10, author = {Ajit A. Diwan}, title = {Cycles of even lengths modulo \emph{k}}, journal = {J. Graph Theory}, volume = {65}, number = {3}, pages = {246--252}, year = {2010}, url = {https://doi.org/10.1002/jgt.20477}, doi = {10.1002/JGT.20477}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Diwan10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Edwards10, author = {Keith Edwards}, title = {Achromatic number of fragmentable graphs}, journal = {J. Graph Theory}, volume = {65}, number = {2}, pages = {94--114}, year = {2010}, url = {https://doi.org/10.1002/jgt.20468}, doi = {10.1002/JGT.20468}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Edwards10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/EnomotoO10, author = {Hikoe Enomoto and Kenta Ozeki}, title = {The independence number condition for the existence of a spanning \emph{f}-tree}, journal = {J. Graph Theory}, volume = {65}, number = {3}, pages = {173--184}, year = {2010}, url = {https://doi.org/10.1002/jgt.20471}, doi = {10.1002/JGT.20471}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/EnomotoO10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/EppleH10, author = {Dennis D. A. Epple and Jing Huang}, title = {A note on the bichromatic numbers of graphs}, journal = {J. Graph Theory}, volume = {65}, number = {4}, pages = {263--269}, year = {2010}, url = {https://doi.org/10.1002/jgt.20479}, doi = {10.1002/JGT.20479}, timestamp = {Fri, 16 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/EppleH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Gao10, author = {Pu Gao}, title = {Connectivity of random regular graphs generated by the pegging algorithm}, journal = {J. Graph Theory}, volume = {65}, number = {3}, pages = {185--197}, year = {2010}, url = {https://doi.org/10.1002/jgt.20472}, doi = {10.1002/JGT.20472}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Gao10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/GauciH10, author = {John Baptist Gauci and Anthony J. W. Hilton}, title = {Continuous \emph{k}-to-1 functions between complete graphs whose orders are of a different parity}, journal = {J. Graph Theory}, volume = {65}, number = {1}, pages = {35--60}, year = {2010}, url = {https://doi.org/10.1002/jgt.20464}, doi = {10.1002/JGT.20464}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/GauciH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HefetzST10, author = {Dan Hefetz and Annina Saluz and Huong T. T. Tran}, title = {An application of the combinatorial Nullstellensatz to a graph labelling problem}, journal = {J. Graph Theory}, volume = {65}, number = {1}, pages = {70--82}, year = {2010}, url = {https://doi.org/10.1002/jgt.20466}, doi = {10.1002/JGT.20466}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgt/HefetzST10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HlinenyS10, author = {Petr Hlinen{\'{y}} and Gelasio Salazar}, title = {Stars and bonds in crossing-critical graphs}, journal = {J. Graph Theory}, volume = {65}, number = {3}, pages = {198--215}, year = {2010}, url = {https://doi.org/10.1002/jgt.20473}, doi = {10.1002/JGT.20473}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HlinenyS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/JiaLW10, author = {Bin Jia and Zai Ping Lu and Gai Xia Wang}, title = {A class of symmetric graphs with 2-arc transitive quotients}, journal = {J. Graph Theory}, volume = {65}, number = {3}, pages = {232--245}, year = {2010}, url = {https://doi.org/10.1002/jgt.20476}, doi = {10.1002/JGT.20476}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/JiaLW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Kostochka10, author = {Alexandr V. Kostochka}, title = {On \emph{K}\({}_{\mbox{\emph{s, t}}}\) minors in (\emph{s}+\emph{t})-chromatic graphs}, journal = {J. Graph Theory}, volume = {65}, number = {4}, pages = {343--350}, year = {2010}, url = {https://doi.org/10.1002/jgt.20485}, doi = {10.1002/JGT.20485}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Kostochka10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/KovacsKM10, author = {Istv{\'{a}}n Kov{\'{a}}cs and Klavdija Kutnar and Dragan Marusic}, title = {Classification of edge-transitive rose window graphs}, journal = {J. Graph Theory}, volume = {65}, number = {3}, pages = {216--231}, year = {2010}, url = {https://doi.org/10.1002/jgt.20475}, doi = {10.1002/JGT.20475}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/KovacsKM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Mader10a, author = {Wolfgang Mader}, title = {Connectivity keeping paths in \emph{k}-connected graphs}, journal = {J. Graph Theory}, volume = {65}, number = {1}, pages = {61--69}, year = {2010}, url = {https://doi.org/10.1002/jgt.20465}, doi = {10.1002/JGT.20465}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Mader10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/McGuinness10, author = {Sean McGuinness}, title = {Cycle and cocycle coverings of graphs}, journal = {J. Graph Theory}, volume = {65}, number = {4}, pages = {270--284}, year = {2010}, url = {https://doi.org/10.1002/jgt.20480}, doi = {10.1002/JGT.20480}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/McGuinness10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/PecherZ10, author = {Arnaud P{\^{e}}cher and Xuding Zhu}, title = {Claw-free circular-perfect graphs}, journal = {J. Graph Theory}, volume = {65}, number = {2}, pages = {163--172}, year = {2010}, url = {https://doi.org/10.1002/jgt.20474}, doi = {10.1002/JGT.20474}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/PecherZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/RusinovS10, author = {Momchil Rusinov and Pascal Schweitzer}, title = {Homomorphism-homogeneous graphs}, journal = {J. Graph Theory}, volume = {65}, number = {3}, pages = {253--262}, year = {2010}, url = {https://doi.org/10.1002/jgt.20478}, doi = {10.1002/JGT.20478}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/RusinovS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ScheideS10, author = {Diego Scheide and Michael Stiebitz}, title = {Vizing's coloring algorithm and the fan number}, journal = {J. Graph Theory}, volume = {65}, number = {2}, pages = {115--138}, year = {2010}, url = {https://doi.org/10.1002/jgt.20469}, doi = {10.1002/JGT.20469}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ScheideS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ZhouF10, author = {Jin{-}Xin Zhou and Yan{-}Quan Feng}, title = {Cubic vertex-transitive graphs of order 2\emph{pq}}, journal = {J. Graph Theory}, volume = {65}, number = {4}, pages = {285--302}, year = {2010}, url = {https://doi.org/10.1002/jgt.20481}, doi = {10.1002/JGT.20481}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ZhouF10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Zwols10, author = {Yori Zwols}, title = {\emph{K}\({}_{\mbox{4}}\)-free graphs with no odd hole: Even pairs and the circular chromatic number}, journal = {J. Graph Theory}, volume = {65}, number = {4}, pages = {303--322}, year = {2010}, url = {https://doi.org/10.1002/jgt.20482}, doi = {10.1002/JGT.20482}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Zwols10.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.