default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 45
Volume 45, Number 1, January 2025
- Fei Wen, Li Zhou, Zepeng Li:
Adjacent vertex strongly distinguishing total coloring of graphs with lower average degree. 5-20 - Saieed Akbari, Nima Ghanbari
, Michael A. Henning:
End super dominating sets in graphs. 21-47 - Geoffrey Boyer, Wayne Goddard:
Domination in graphs and the removal of a matching. 49-65 - Magda Dettlaff, Michael A. Henning, Jerzy Topp:
Characterization of α-excellent 2-trees. 67-80 - Fayun Cao, Han Ren:
The tree-achieving set and non-separating independent set problem of subcubic graphs. 81-93 - Akbar Ali, Gary Chartrand, Ping Zhang:
On link-irregular graphs. 95-110 - Shariefuddin Pirzada, Saleem Khan, Francesco Belardo:
On the distribution of distance signless Laplacian eigenvalues with given independence and chromatic number. 111-128 - Yingli Kang, Hongkai Lu, Ligang Jin:
(I, F)-partition of planar graphs without cycles of length 4, 6, or 9. 129-150 - Ernst J. Joubert, Johannes H. Hattingh:
Bipartite Ramsey number pairs involving cycles. 151-190 - Myungho Choi, Minki Kwak, Suh-Ryung Kim:
The triangle-free graphs that are competition graphs of multipartite tournaments. 191-217 - Jan Ekstein, Jakub Teska:
Hamiltonian properties in generalized lexicographic products. 219-237 - Oleg V. Borodin, Anna O. Ivanova:
Tight description of faces in toroidal graphs with minimum degree at least 4. 239-251 - Hongzhang Chen, Xiaoyun Lv, Jianxi Li, Shou-Jun Xu:
Sufficient conditions for spanning trees with constrained leaf distance in a graph. 253-266 - Silvia B. Tondato:
On a problem of L. Alcón concerning path domination. 267-281 - Jaka Hedzet, Michael A. Henning:
3-neighbor bootstrap percolation on grids. 283-310 - Kirsten Hogenson, Dan Johnston, Suzanne O'Hara:
Equitable choosability of prism graphs. 311-330 - Abel Cabrera Martínez, Magda Dettlaff, Magdalena Lemanska, Juan Alberto Rodríguez-Velázquez:
Restrained differential of a graph. 331-350 - Julien Bensmail:
Maximising 1’s through proper labellings. 351-376 - Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski:
Twins in ordered hyper-matchings. 377-394 - Yan Li, Yahui Zhang, Ping Zhang:
Multicolor Ramsey numbers and star-critical Ramsey numbers involving fans. 395-409 - Allan Bickle, Allen J. Schwenk:
Corrigendum to "Minimum edge cuts in diameter 2 graphs". 411-414
Volume 45, Number 2, April 2025
- Sinan Hu, Zhidan Luo:
Ramsey numbers for a large tree versus multiple copies of complete graphs of different sizes. 419-429 - Andrea L. Gallo, Denis E. Videla:
Number of cliques of Paley-type graphs over finite commutative local rings. 431-449 - Jirí Fiala, Michaela Seifrtová:
A novel approach to covers of multigraphs with semi-edges. 451-481 - Carl Johan Casselgren, Fikre B. Petros, Samuel Asefa Fufa:
Extending partial edge colorings of Cartesian products of graphs. 483-507 - Gabriele Di Stefano, Sandi Klavzar, Aditi Krishnakumar, James Tuite, Ismael G. Yero:
Lower general position sets in graphs. 509-531 - Saeid Alikhani, Davood Bakhshesh, Hamid R. Golmohammadi, Sandi Klavzar:
On independent coalition in graphs and independent coalition graphs. 533-544 - Gopika Sharma, Arti Pandey:
Double dominating sequences in bipartite and co-bipartite graphs. 545-564 - Erica Liu, Jian Wang:
The generalized Turán problem of two intersecting cliques. 565-594 - Mingyuan Ma, Han Ren:
The decycling number of a graph with large girth embedded in a surface. 595-614 - Fatih Yetgin, Ugur Odabasi, Sibel Özkan:
The directed uniform Hamilton-Waterloo Problem involving even cycle sizes. 615-636 - Július Czap, Stanislav Jendrol', Peter Sugerek:
On 𝒫 vertex-connections of graphs. 637-652 - Julia Hoepner, Gary MacGillivray, Christina M. Mynhardt:
Lower boundary independent and hearing independent broadcasts in graphs. 653-675 - Bryan Freyberg, Ryan Peters:
Decomposition of complete graphs into forests with six edges. 677-706 - Yair Caro, Xandru Mifsud:
On (r, c)-constant, planar and circulant graphs. 707-723 - Guoliang Hao, Xiaodan Chen, Zhihong Xie, Seyed Mahmoud Sheikholeslami:
Some results on the global triple Roman domination in graphs. 725-754 - Zhidan Luo:
Star-critical Ramsey numbers and regular Ramsey numbers for stars. 755-762 - Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski:
Edge coloring of products of signed graphs. 763-786
Volume 45, Number 3, July 2025
- Hengzhe Li, Menghan Ma, Shuli Zhao, Jianbing Liu:
The structure of 2-matching connected graphs. 791-807 - Thomas Lewis, Fabian Salinas:
Optimal pebbling of complete binary trees and a meta-Fibonacci sequence. 809-822 - Luyi Li, Xueliang Li, Yaping Mao, Yuan Si:
Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs. 823-844 - Luis Boza, Stanislaw P. Radziszowski:
Some upper bounds on Ramsey numbers involving C4. 845-856 - Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Nacéra Meddah:
Bounds on the k-conversion number. 857-871 - Hong Yang, Juan Liu, Jixiang Meng:
Antidirected spanning trail of digraphs with \alpha2-stable number 3. 873-887 - Shuai Kou, Weihau Yang:
Contractible subgraphs of quasi 5-connected graphs. 889-903 - Michal Walicki:
Poison Game for semikernels of arbitrary digraphs. 905-913 - Davood Bakhshesh, Michael A. Henning:
Complementary coalition graphs: characterization and algorithm. 915-925 - Jia Huang:
Dissociation in circulant graphs and integer distance graphs. 927-942 - José Cáceres, Ignacio M. Pelayo:
Reconstructing a graph from the boundary distance matrix. 943-970 - Yujia Gao, Meng Ji, Yaping Mao, Meiqin Wei:
Ramsey and Gallai-Ramsey numbers for forests. 971-994 - Xiaoling Liu, Lei Sun, Wei Zheng:
Equitable cluster partition of graphs with small maximum average degree. 995-1018 - Hongzhang Chen, Jianxi Li, Bin Sun, Shou-Jun Xu:
Some results on the k-alliance and domination of graphs. 1019-1039 - Xuemei Liu, Jixiang Meng:
On the restricted arc-connectivity of oriented graphs. 1041-1054 - Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh:
Majority dominator colorings of graphs. 1055-1079 - Joanna Jasinska, Gyula O. H. Katona:
The number of disjoint pairs in families of k-element subsets. 1081-1089
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 2025-10-24 21:52 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:
