default search action
Journal of Graph Theory, Volume 104
Volume 104, Number 1, September 2023
- Issue Information. 1-3
- Celina M. H. de Figueiredo, Alexsander Andrade de Melo
, Fabiano de S. Oliveira
MaxCut on permutation graphs is NP-complete. 5-16 - Marthe Bonamy, Théo Pierron, Éric Sopena:
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable. 17-86 - Alan M. Frieze
Spanners in randomly weighted graphs: Euclidean case. 87-103 - Victor Falgas-Ravry
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers. 104-132 - Meiqiao Zhang
ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2-(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$. 133-149 - Christopher Duffy
On deeply critical oriented cliques. 150-159 - Danyi Li, Wuxian Chen, Weigen Yan
Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest. 160-170 - Janusz Dybizbanski
Equitable oriented coloring. 171-187 - Jurgen Aliaj
Adaptable and conflict colouring multigraphs with no cycles of length three or four. 188-219 - Bernard Lidický
C5 ${C}_{5}$ is almost a fractalizer. 220-244 - Daniël M. H. van Gent
Nonabelian flows in networks. 245-256
Volume 104, Number 2, October 2023
- Issue Information. 257-260
- Xiutao Zhu, Yaojun Chen
Turán number for odd-ballooning of trees. 261-274 - Bahareh Afshari:
Algebraic connectivity of the second power of a graph. 275-281 - Robert E. L. Aldred
Edge proximity conditions for extendability in regular bipartite graphs. 282-288 - Oliver Bachtler
Automated testing and interactive construction of unavoidable sets for graph classes of small path-width. 289-319 - Felix Bock, Johannes Pardey
Relating the independence number and the dissociation number. 320-340 - Luyi Li, Ping Li
Rainbow structures in a collection of graphs with degree conditions. 341-359 - Guantao Chen, Yanli Hao, Guoning Yu
Linear arboricity of degenerate graphs. 360-371 - Eun-Kyung Cho
A tight bound for independent domination of cubic graphs without 4-cycles. 372-386 - Inon Attias, Ishay Haviv:
Local orthogonality dimension. 387-419 - Calum Buchanan
Odd covers of graphs. 420-439 - Cory Palmer
On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza. 440-445
Volume 104, Number 3, November 2023
- Issue Information. 447-449
- Iliya Bluskov, Jan de Heer, Alexander F. Sidorenko
Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5-cycles. 451-460 - Mikolaj Lewandowski, Joanna Polcyn
Two disjoint cycles in digraphs. 461-469 - He Guo
Bounds on Ramsey games via alterations. 470-484 - Mingyang Guo, Hongliang Lu
Improved bound on vertex degree version of Erdős matching conjecture. 485-498 - Maria Chudnovsky
Polynomial bounds for chromatic number VII. Disjoint holes. 499-515 - Luyining Gan, Jie Han
Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs. 516-556 - Ron Aharoni, Joseph Briggs
Rainbow independent sets in certain classes of graphs. 557-584 - Mirko Petrusevski
Odd edge-colorings of subdivisions of odd graphs. 585-610 - Reza Naserasr
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$. 611-644 - Xiaolin Chen, Guangbiao Wei, Huishu Lian
Solution to a conjecture on the mean subtree order of graphs under edge addition. 645-658 - Marthe Bonamy, Jadwiga Czyzewska
Partitioning edges of a planar graph into linear forests and a matching. 659-677
Volume 104, Number 4, December 2023
- Issue Information. 679-681
- Thilo Krill:
Universal graphs for the topological minor relation. 683-696 - Dandan Fan, Xiaofeng Gu
Spectral radius and edge-disjoint spanning trees. 697-711 - Jialu Zhu
Bad list assignments for non-k $k$-choosable k $k$-chromatic graphs with 2k+2 $2k+2$-vertices. 712-726 - Jürgen Jost, Raffaella Mulas
Petals and books: The largest Laplacian spectral gap from 1. 727-756 - Maria Axenovich
Interval colorings of graphs - Coordinated and unstable no-wait schedules. 757-768 - Konrad K. Dabrowski
Clique-width: Harnessing the power of atoms. 769-810 - Sylwia Antoniuk, Andrzej Dudek
Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection. 811-835 - Jiaxi Nie
On asymptotic packing of convex geometric and ordered graphs. 836-850 - Xujun Liu, Michael Santana
Every subcubic multigraph is (1,27) $(1,{2}^{7})$-packing edge-colorable. 851-885 - Songling Shan
Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree. 886-903 - Vladislav Kozhevnikov
Large cycles in generalized Johnson graphs. 904-918
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-12-09 22:16 CET 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: