![](https://dblp1.uni-trier.de/img/logo.320x120.png)
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/jgt/jgt90.bht:"
@article{DBLP:journals/jgt/AkbariHO19, author = {Saieed Akbari and Morteza Hasanvand and Kenta Ozeki}, title = {Highly edge-connected factors using given lists on degrees}, journal = {J. Graph Theory}, volume = {90}, number = {2}, pages = {150--159}, year = {2019}, url = {https://doi.org/10.1002/jgt.22373}, doi = {10.1002/JGT.22373}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/AkbariHO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/AldredFS19, author = {Robert E. L. Aldred and Jun Fujisawa and Akira Saito}, title = {Pairs and triples of forbidden subgraphs and the existence of a 2-factor}, journal = {J. Graph Theory}, volume = {90}, number = {1}, pages = {61--82}, year = {2019}, url = {https://doi.org/10.1002/jgt.22368}, doi = {10.1002/JGT.22368}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/AldredFS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Bahmanian19, author = {M. Amin Bahmanian}, title = {Extending edge-colorings of complete hypergraphs into regular colorings}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {547--560}, year = {2019}, url = {https://doi.org/10.1002/jgt.22412}, doi = {10.1002/JGT.22412}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Bahmanian19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BarberoPP19, author = {Florian Barbero and Christophe Paul and Michal Pilipczuk}, title = {Strong immersion is a well-quasi-ordering for semicomplete digraphs}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {484--496}, year = {2019}, url = {https://doi.org/10.1002/jgt.22408}, doi = {10.1002/JGT.22408}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BarberoPP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BedenknechtMRS19, author = {Wiebke Bedenknecht and Guilherme Oliveira Mota and Christian Reiher and Mathias Schacht}, title = {On the local density problem for graphs of given odd-girth}, journal = {J. Graph Theory}, volume = {90}, number = {2}, pages = {137--149}, year = {2019}, url = {https://doi.org/10.1002/jgt.22372}, doi = {10.1002/JGT.22372}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BedenknechtMRS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BoncompagniRV19, author = {Valerio Boncompagni and Marko Radovanovic and Kristina Vuskovic}, title = {The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {591--628}, year = {2019}, url = {https://doi.org/10.1002/jgt.22415}, doi = {10.1002/JGT.22415}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BoncompagniRV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ChudnovskyS19, author = {Maria Chudnovsky and Vaidy Sivaraman}, title = {Perfect divisibility and 2-divisibility}, journal = {J. Graph Theory}, volume = {90}, number = {1}, pages = {54--60}, year = {2019}, url = {https://doi.org/10.1002/jgt.22367}, doi = {10.1002/JGT.22367}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ChudnovskyS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/CzabarkaSW19, author = {{\'{E}}va Czabarka and L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and Stephan G. Wagner}, title = {A tanglegram Kuratowski theorem}, journal = {J. Graph Theory}, volume = {90}, number = {2}, pages = {111--122}, year = {2019}, url = {https://doi.org/10.1002/jgt.22370}, doi = {10.1002/JGT.22370}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/CzabarkaSW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Debski19, author = {Michal Debski}, title = {Strong chromatic index of unit distance graphs}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {523--534}, year = {2019}, url = {https://doi.org/10.1002/jgt.22410}, doi = {10.1002/JGT.22410}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Debski19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/DvorakF19, author = {Tom{\'{a}}s Dvor{\'{a}}k and Jir{\'{\i}} Fink}, title = {Gray codes extending quadratic matchings}, journal = {J. Graph Theory}, volume = {90}, number = {2}, pages = {123--136}, year = {2019}, url = {https://doi.org/10.1002/jgt.22371}, doi = {10.1002/JGT.22371}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/DvorakF19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/DvorakMMP19, author = {Zdenek Dvor{\'{a}}k and Tom{\'{a}}s Masar{\'{\i}}k and Jan Mus{\'{\i}}lek and Ondrej Pangr{\'{a}}c}, title = {Triangle-free planar graphs with the smallest independence number}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {443--454}, year = {2019}, url = {https://doi.org/10.1002/jgt.22406}, doi = {10.1002/JGT.22406}, timestamp = {Fri, 01 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgt/DvorakMMP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/EllinghamMOT19, author = {Mark N. Ellingham and Emily Abernethy Marshall and Kenta Ozeki and Shoichi Tsuchiya}, title = {Hamiltonicity of planar graphs with a forbidden minor}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {459--483}, year = {2019}, url = {https://doi.org/10.1002/jgt.22407}, doi = {10.1002/JGT.22407}, timestamp = {Tue, 19 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/EllinghamMOT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ErgemlidzeMSG19, author = {Beka Ergemlidze and Abhishek Methuku and Nika Salia and Ervin Gy{\"{o}}ri}, title = {A note on the maximum number of triangles in a C5-free graph}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {227--230}, year = {2019}, url = {https://doi.org/10.1002/jgt.22390}, doi = {10.1002/JGT.22390}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ErgemlidzeMSG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Galeana-Sanchez19, author = {Hortensia Galeana{-}S{\'{a}}nchez and C{\'{e}}sar Hern{\'{a}}ndez{-}Cruz}, title = {A dichotomy for the kernel by H-walks problem in digraphs}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {213--226}, year = {2019}, url = {https://doi.org/10.1002/jgt.22389}, doi = {10.1002/JGT.22389}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Galeana-Sanchez19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HeWYZ19, author = {Jinghua He and Erling Wei and Dong Ye and Shaohui Zhai}, title = {On perfect matchings in matching covered graphs}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {535--546}, year = {2019}, url = {https://doi.org/10.1002/jgt.22411}, doi = {10.1002/JGT.22411}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HeWYZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HladkyHP19, author = {Jan Hladk{\'{y}} and Ping Hu and Diana Piguet}, title = {Koml{\'{o}}s's tiling theorem via graphon covers}, journal = {J. Graph Theory}, volume = {90}, number = {1}, pages = {24--45}, year = {2019}, url = {https://doi.org/10.1002/jgt.22365}, doi = {10.1002/JGT.22365}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HladkyHP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/JavadiH19, author = {Ramin Javadi and Sepehr Hajebi}, title = {Edge clique cover of claw-free graphs}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {311--405}, year = {2019}, url = {https://doi.org/10.1002/jgt.22403}, doi = {10.1002/JGT.22403}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/JavadiH19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Kothari19, author = {Nishad Kothari}, title = {Generating near-bipartite bricks}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {565--590}, year = {2019}, url = {https://doi.org/10.1002/jgt.22414}, doi = {10.1002/JGT.22414}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Kothari19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Le19, author = {Ngoc{-}Khang Le}, title = {Detecting an induced subdivision of {K4}}, journal = {J. Graph Theory}, volume = {90}, number = {2}, pages = {160--171}, year = {2019}, url = {https://doi.org/10.1002/jgt.22374}, doi = {10.1002/JGT.22374}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Le19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/LeeNO19, author = {Min Jung Lee and Sungjong No and Seungsang Oh}, title = {Arc index of spatial graphs}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {406--415}, year = {2019}, url = {https://doi.org/10.1002/jgt.22404}, doi = {10.1002/JGT.22404}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/LeeNO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/LetzterS19, author = {Shoham Letzter and Richard Snyder}, title = {The homomorphism threshold of -free graphs}, journal = {J. Graph Theory}, volume = {90}, number = {1}, pages = {83--106}, year = {2019}, url = {https://doi.org/10.1002/jgt.22369}, doi = {10.1002/JGT.22369}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/LetzterS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/LiSWYZ19, author = {Tong Li and Zi{-}Xia Song and Guanghui Wang and Donglei Yang and Cun{-}Quan Zhang}, title = {Antimagic orientations of even regular graphs}, journal = {J. Graph Theory}, volume = {90}, number = {1}, pages = {46--53}, year = {2019}, url = {https://doi.org/10.1002/jgt.22366}, doi = {10.1002/JGT.22366}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/LiSWYZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Lo19, author = {Allan Lo}, title = {Long properly coloured cycles in edge-coloured graphs}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {416--442}, year = {2019}, url = {https://doi.org/10.1002/jgt.22405}, doi = {10.1002/JGT.22405}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Lo19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/LuzarMS19, author = {Borut Luzar and Martina Mockovciakov{\'{a}} and Roman Sot{\'{a}}k}, title = {Note on list star edge-coloring of subcubic graphs}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {304--310}, year = {2019}, url = {https://doi.org/10.1002/jgt.22402}, doi = {10.1002/JGT.22402}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/LuzarMS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MaY19, author = {Jie Ma and Tianchi Yang}, title = {Decomposing C4-free graphs under degree constraints}, journal = {J. Graph Theory}, volume = {90}, number = {1}, pages = {13--23}, year = {2019}, url = {https://doi.org/10.1002/jgt.22364}, doi = {10.1002/JGT.22364}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MaY19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/MerkerP19, author = {Martin Merker and Luke Postle}, title = {Bounded diameter arboricity}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {629--641}, year = {2019}, url = {https://doi.org/10.1002/jgt.22416}, doi = {10.1002/JGT.22416}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/MerkerP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Meroueh19, author = {Ar{\`{e}}s M{\'{e}}roueh}, title = {The Ramsey number of loose cycles versus cliques}, journal = {J. Graph Theory}, volume = {90}, number = {2}, pages = {172--188}, year = {2019}, url = {https://doi.org/10.1002/jgt.22387}, doi = {10.1002/JGT.22387}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Meroueh19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/NakamotoNO19, author = {Atsuhiro Nakamoto and Kenta Noguchi and Kenta Ozeki}, title = {Spanning bipartite quadrangulations of even triangulations}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {267--287}, year = {2019}, url = {https://doi.org/10.1002/jgt.22400}, doi = {10.1002/JGT.22400}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/NakamotoNO19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ScottSW19, author = {Alex Scott and Paul D. Seymour and David R. Wood}, title = {Bad news for chordal partitions}, journal = {J. Graph Theory}, volume = {90}, number = {1}, pages = {5--12}, year = {2019}, url = {https://doi.org/10.1002/jgt.22363}, doi = {10.1002/JGT.22363}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ScottSW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/SpinozaW19, author = {Hannah Spinoza and Douglas B. West}, title = {Reconstruction from the deck of -vertex induced subgraphs}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {497--522}, year = {2019}, url = {https://doi.org/10.1002/jgt.22409}, doi = {10.1002/JGT.22409}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/SpinozaW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Spiro19, author = {Sam Spiro}, title = {Polynomial relations between matrices of graphs}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {288--303}, year = {2019}, url = {https://doi.org/10.1002/jgt.22401}, doi = {10.1002/JGT.22401}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Spiro19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Taylor19, author = {Amelia Taylor}, title = {On the exact decomposition threshold for even cycles}, journal = {J. Graph Theory}, volume = {90}, number = {3}, pages = {231--266}, year = {2019}, url = {https://doi.org/10.1002/jgt.22399}, doi = {10.1002/JGT.22399}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Taylor19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Zamfirescu19, author = {Carol T. Zamfirescu}, title = {Cubic vertices in planar hypohamiltonian graphs}, journal = {J. Graph Theory}, volume = {90}, number = {2}, pages = {189--207}, year = {2019}, url = {https://doi.org/10.1002/jgt.22388}, doi = {10.1002/JGT.22388}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Zamfirescu19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/Zhong19, author = {Liang Zhong}, title = {The 1-2-3-conjecture holds for dense graphs}, journal = {J. Graph Theory}, volume = {90}, number = {4}, pages = {561--564}, year = {2019}, url = {https://doi.org/10.1002/jgt.22413}, doi = {10.1002/JGT.22413}, timestamp = {Fri, 28 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/Zhong19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.