default search action
Journal of Graph Theory, Volume 103
Volume 103, Number 1, May 2023
- Issue Information. 1-3
- Jørgen Bang-Jensen
, Kasper Skov Johansen, Anders Yeo
Making a tournament k $k$-strong. 5-11 - Alberto Espuny Díaz
Hamiltonicity of graphs perturbed by a random geometric graph. 12-22 - Karl Heuer
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls. 23-47 - Yan Cao, Guantao Chen, Xuli Qi
Double Vizing fans in critical class two graphs. 48-65 - Benjamin R. Moore
A density bound for triangle-free 4-critical graphs. 66-111 - James Davies:
Triangle-free graphs with large chromatic number and no induced wheel. 112-118 - Xia Liu, Zdenek Ryjácek
Hamilton-connected {claw,net}-free graphs, II. 119-138 - Carl Feghali
Kempe equivalence of 4-critical planar graphs. 139-147 - Jie Ma
Towards a conjecture of Birmelé-Bondy-Reed on the Erdős-Pósa property of long cycles. 148-158 - Eun-Kyung Cho, Ilkyoo Choi
On independent domination of regular graphs. 159-170
Volume 103, Number 2, June 2023
- Issue Information. 171-173
- Sean Dewar
Classifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane. 175-185 - Stéphane Bessy, Jocelyn Thiebaut:
Complementary cycles of any length in regular bipartite tournaments. 186-211 - Petr Gregor
Star transposition Gray codes for multiset permutations. 212-270 - Masahiro Sanka
Forbidden subgraphs and 2-factors in 3/2-tough graphs. 271-284 - Hemanshu Kaul
DP-coloring Cartesian products of graphs. 285-306 - Corrigendum to 'flexible circuits in the d $d$-dimensional rigidity matroid'. 307-308
- Tianyu Li
Ramsey numbers of the quadrilateral versus books. 309-322 - Raphael Steiner
On coloring digraphs with forbidden induced subgraphs. 323-339 - Shuya Chiba, Katsuhiro Ota, Tomoki Yamashita:
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two. 340-358 - Mohammad Hadi Shekarriz
Distinguishing threshold of graphs. 359-377 - József Balogh, Sean English
Lower bounds on the Erdős-Gyárfás problem via color energy graphs. 378-409
Volume 103, Number 3, July 2023
- Issue Information. 411-413
- Stefan Steinerberger
Curvature on graphs via equilibrium measures. 415-436 - Maria Chudnovsky
Proof of a conjecture of Plummer and Zha. 437-450 - Yury Demidovich, Maksim Zhukovskii:
Tight asymptotics of clique-chromatic numbers of dense random graphs. 451-461 - Pierre Charbit, Michel Habib, Lalla Mouatadid
A new graph parameter to measure linearity. 462-485 - Binlong Li, Bo Ning
Eigenvalues and cycles of consecutive lengths. 486-492 - Yangyan Gu, Xuding Zhu
Girth and λ $\lambda $-choosability of graphs. 493-501 - Zdenek Dvorák, Jakub Pekárek
Induced odd cycle packing number, independent sets, and chromatic number. 502-516 - Yan Cao
The average degree of edge chromatic critical graphs with maximum degree seven. 517-541 - Tsz Lung Chan, Matthias Kriesell
Contractible edges in longest cycles. 542-563 - Nathan J. Bowler, Christian Elbracht
Ubiquity of graphs with nowhere-linear end structure. 564-598 - Noga Alon, Michael Krivelevich
Complete minors and average degree: A short proof. 599-602
Volume 103, Number 4, August 2023
- Issue Information. 603-605
- Anton Bernshteyn
Weak degeneracy of graphs. 607-634 - Jamie V. de Jong
Strong 3-Flow Conjecture for projective planar graphs. 635-660 - Felix Bock, Johannes Pardey
A bound on the dissociation number. 661-673 - Jasine Babu, Deepu Benson
Improved bounds for the oriented radius of mixed multigraphs. 674-689 - Juan Gutiérrez
All longest cycles in a 2-connected partial 3-tree share a common vertex. 690-712 - Yi-ze Chen, Xin Li, Xiao-Dong Zhang
The extremal average distance of cubic graphs. 713-739 - Meiqiao Zhang
DP color functions versus chromatic polynomials (II). 740-761 - Hamid Reza Daneshpajouh:
A counterexample to a conjecture on the chromatic number of r $r$-stable Kneser hypergraphs. 762-766 - Fábio Botler
The mod k $k$ chromatic index of random graphs. 767-779 - Lior Gishboliner
Oriented discrepancy of Hamilton cycles. 780-792
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-28 01:18 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: