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
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-01-10 18:37 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:
