


default search action
Discussiones 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
, Hamidreza 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
Volume 45, Number 4, October 2025
- Ali Ghanbari, Doost Ali Mojdeh:

On two conjectures regarding the neighbor-locating chromatic number. 1095-1103 - Joy Morris

:
Walecki tournaments with an arc that lies in a unique directed triangle. 1105-1122 - Zahra Hamed-Labbafian, Michael A. Henning

, Mostafa Tavakoli, Narjes Sabeghi:
Recognizable coloring of graphs. 1123-1138 - Gábor Bacsó, Csilla Bujtás

, Balázs Patkós, Zsolt Tuza, Máté Vizer:
The robust chromatic number of certain graph classes. 1139-1155 - Sergey Kitaev

, Artem V. Pyatkin:
A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs. 1157-1162 - Meng Ji:

Non-path results on the connectivity keeping problem. 1163-1184 - Qing Jie, Zemin Jin

:
Anti-Ramsey number of union of 5-path and matching. 1185-1210 - Fei Zhang, Danjun Huang:

Vertex partitions of (C4, C5, C10)-free planar graphs. 1211-1231 - Shohei Koizumi, Yusuke Suzuki:

The matching extendability of optimal 1-embedded graphs on the projective plane. 1233-1248 - Atílio G. Luiz

, Francisco A. Vieira:
Independent [k]-Roman domination on graphs. 1249-1272 - Wayne Goddard, Tyler Herrman, Simon Hughes:

Bounds on coloring trees without rainbow paths. 1273-1285 - Minhui Li, Shumin Zhang, Chengfu Ye:

The probabilistic upper bounds on the isolation number of a graph. 1287-1296 - Yexin Zheng, Chang-Qing Xu, Yongxin Lan:

The planar Turán number of {C6, C7}. 1297-1321 - Xia Li, Yashu Li, Weihua Yang:

Hamiltonian cycles through a linear forest in bipartite graphs. 1323-1329 - Abel Cabrera Martínez

, Ismael Ríos Villamar
, José L. Sánchez, José María Sigarreta:
Total {2}-domination in a graph and its complement. 1331-1343 - Michael A. Henning

, Jerzy Topp
:
On total domination subdivision numbers of trees. 1345-1360 - Yuqi Xu, Linsong Wei, Weihua Yang:

The excluded minor theorem for the Petersen graph contracting exactly two edges of a perfect matching and one other edge. 1361-1374

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














