default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 105
Volume 105, Number 1, January 2024
ARTICLES
- Tuvi Etzion:
Graphs with the unique path property: Structure, cycles, factors, and constructions. 5-33 - Bogdan Alecu
, Vadim V. Lozin, Dmitriy S. Malyshev:
Critical properties of bipartite permutation graphs. 34-60 - Marcin Stawiski, Trevor M. Wilson:
The distinguishing index of graphs with infinite minimum degree. 61-67 - P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad:
Disjoint total dominating sets in near-triangulations. 68-77 - Raphael Steiner:
Subdigraphs of prescribed size and out-degree. 78-82 - James M. Shook:
Maximally edge-connected realizations and Kundu's k $k$ -factor theorem. 83-97 - Ademir Hujdurovic, Ðorde Mitrovic:
Some conditions implying stability of graphs. 98-109 - Fangfang Wu, Hajo Broersma, Shenggui Zhang, Binlong Li:
Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs. 110-135 - Raphael Steiner:
Subdivisions with congruence constraints in digraphs of large chromatic number. 136-143
Volume 105, Number 2, February 2024
ARTICLES
- Arnab Char, Thiyagarajan Karthick:
Optimal chromatic bound for ( ¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$ )-free graphs. 149-178 - Robert Hickingbotham, Paul Jungeblut, Laura Merker, David R. Wood:
The product structure of squaregraphs. 179-191 - Sam Spiro:
Random polynomial graphs for random Turán problems. 192-208 - Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt:
Rooted minors and locally spanning subgraphs. 209-229 - Hamid Reza Daneshpajouh:
On the number of star-shaped classes in optimal colorings of Kneser graphs. 230-238 - Narda Cordero-Michel, Hortensia Galeana-Sánchez:
Congruence of cycle lengths and chromatic number. 239-251 - Andrea C. Burgess, Robert D. Luther, David A. Pike:
The edge-connectivity of vertex-transitive hypergraphs. 252-259 - Jian Wang, Shipeng Wang, Weihua Yang:
Counterexamples to Gerbner's conjecture on stability of maximal F-free graphs. 260-284 - Jianfeng Wang, Wenqian Zhang, Yiqiao Wang, Zoran Stanic:
On the order of antipodal covers. 285-296 - Bin Chen, An Chang:
Disjoint cycles in tournaments and bipartite tournaments. 297-314 - Guantao Chen, Yanli Hao, Guoning Yu:
A decomposition method on solving the linear arboricity conjecture. 315-332
Volume 105, Number 3, March 2024
ARTICLES
- Klavdija Kutnar, Dragan Marusic, Stefko Miklavic, Primoz Sparl:
On the structure of consistent cycles in cubic symmetric graphs. 337-356 - Stijn Cambie, Guantao Chen, Yanli Hao, Nizamettin Tokar:
Decreasing the mean subtree order by adding k edges. 357-366 - Deepak Bal, Louis DeBiasio:
Large monochromatic components in hypergraphs with large minimum codegree. 367-372 - Carl Johan Casselgren:
Brooks' theorem with forbidden colors. 373-385 - Hemanshu Kaul, Akash Kumar, Jeffrey A. Mudrock, Patrick Rewers, Paul Shin, Khue To:
On the list color function threshold. 386-397 - Yangyan Gu, Xuding Zhu:
The Alon-Tarsi number of planar graphs revisited. 398-402 - Liqiong Xu:
Uniformly 3-connected graphs. 403-412 - Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang, Anders Yeo, Yacong Zhou:
On Seymour's and Sullivan's second neighbourhood conjectures. 413-426 - Tamás Csernák, Lajos Soukup:
Elusive properties of infinite graphs. 427-450 - Tibor Jordán:
Ear-decompositions, minimally connected matroids and rigid graphs. 451-467 - Michael A. Henning, Anders Yeo:
Transversals in regular uniform hypergraphs. 468-485
Volume 105, Number 4, April 2024
ARTICLES
- Tolson Bell, Alan M. Frieze:
Rainbow powers of a Hamilton cycle in Gn,p. 491-500 - John L. Goldwasser, Ryan Hansen:
Inducibility in the hypercube. 501-522 - János Barát, András Gyárfás, Géza Tóth:
Monochromatic spanning trees and matchings in ordered complete graphs. 523-541 - Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions V. one neighbor in a hole. 542-561 - Benjamin Dozier, Jenya Sapir:
Simple versus nonsimple loops on random regular graphs. 562-579 - Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu:
K2-Hamiltonian graphs: II. 580-611 - Borut Luzar, Martina Mockovciaková, Roman Soták:
Revisiting semistrong edge-coloring of graphs. 612-632 - William Chan, Logan Crew:
A graph polynomial from chromatic symmetric functions. 633-651 - Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Heroes in oriented complete multipartite graphs. 652-669 - Daniel W. Cranston, Reem Mahmoud:
5-Coloring reconfiguration of planar graphs with no short odd cycles. 670-679
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.
last updated on 2024-09-19 23:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
