default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 44
Volume 44, Number 1, 2024
- Long-Tu Yuan, Xiao-Dong Zhang:
Extremal graphs for even linear forests in bipartite graphs. 5 - Stefko Miklavic, Primoz Sparl:
On distance magic labelings of Hamming graphs and folded hypercubes. 17 - Leen Droogendijk, Elena V. Konstantinova
:
An improved bound on the chromatic number of the Pancake graphs. 35 - Michael A. Henning, Jerzy Topp:
Minimal graphs with disjoint dominating and total dominating sets. 47 - Elise Marchessault, Kieka Mynhardt:
Lower boundary independent broadcasts in trees. 75 - Martin Sonntag, Hanns-Martin Teichert:
Edge intersection hypergraphs. 101 - Debra L. Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, K. E. Perry, Puck Rombach:
Determining number and cost of generalized Mycielskian graphs. 127 - Emily Eckels, Ervin Györi, Junsheng Liu, Sohaib Nasir:
Set-sequential labelings of odd trees. 151 - Masayoshi Doki, Yoshimi Egawa, Naoki Matsumoto:
Graph grabbing game on graphs with forbidden subgraphs. 171 - Messaouda Ahmane, Isma Bouchemakh, Éric Sopena:
On the broadcast independence number of locally uniform 2-lobsters. 199 - Julien Bensmail:
On a graph labelling conjecture involving coloured labels. 231 - Ruixia Wang, Linxin Wu:
Cycles of many lengths in balanced bipartite digraphs on dominating and dominated degree conditions. 245 - Sooyeon Lee, Haidong Wu:
Beta invariant and chromatic uniqueness of wheels. 269 - Naoki Matsumoto, Kenta Noguchi, Takamasa Yashima:
Cubic graphs having only k-cycles in each 2-factor. 281 - Xiaoling Ma, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
On s-hamiltonian-connected line graphs. 297 - Shaily Verma, Bhawani Sankar Panda:
Adjacent vertex distinguishing total coloring of the corona product of graphs. 317 - Megan Cream, Ronald J. Gould:
Chorded k-pancyclic and weakly k-pancyclic graphs. 337 - Stanislav Jendrol':
2-nearly Platonic graphs. 351 - Tao Tian, Haitze J. Broersma, Liming Xiong:
Edge degree conditions for dominating and spanning closed trails. 363 - Gülnaz Boruzanli Ekinci, Csilla Bujtás:
On the equality of domination number and 2-domination number. 383
Volume 44, Number 2, 2024
- Mirko Hornák:
The achromatic number of the Cartesian product of K6 and Kq. 411 - Weifan Wang, Juan Liu, Yiqiao Wang:
Linear arboricity of 1-planar graphs. 435 - Dengju Ma, Mingyuan Ma, Han Ren:
The decycling number of a planar graph covered by K4-subgraphs. 459 - Xiang Tan, Jian-Liang Wu:
The linear arboricity of graphs with low treewidth. 475 - Kamal Dliou, Hicham El Boujaoui, Mustapha Kchikech:
$L(2,1)$-labeling of the iterated Mycielski graphs of graphs and some problems related to matching problems. 489 - Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz:
Panchromatic patterns by paths. 519 - Guoliang Hao, Shouliu Wei, Seyed Mahmoud Sheikholeslami, Xiaodan Chen:
Bounds on the global double Roman domination number in graphs. 539 - Maoqun Wang, Jianguo Qian:
Degree sum condition for vertex-disjoint 5-cycles. 555 - Wei Yang, Baoyindureng Wu:
Outer connected domination in maximal outerplanar graphs and beyond. 575 - Devin C. Jean, Suk Jai Seo:
Fault-tolerant identifying codes in special classes of graphs. 591 - Carl Johan Casselgren, Fikre B. Petros:
Edge precoloring extension of trees II. 613 - Hortensia Galeana-Sánchez, Miguel Tecpa-Galván:
$(k,H)$-kernels in nearly tournaments. 639 - Brahim Benmedjdoub, Éric Sopena:
Strong incidence colouring of graphs. 663 - Johan P. de Wet, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann:
On the Strong Path Partition Conjecture. 691 - Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu:
A note on minimum degree, bipartite holes, and Hamiltonian properties. 717 - Imran Allie, Jordan Arenstein:
Resistance in regular class two graphs. 727 - Ruxandra Marinescu-Ghemeci, Camelia Obreja, Alexandru Popa:
Approximate and exact results for the harmonious chromatic number. 737 - Julien Bensmail:
A \sigma3 condition for arbitrarily partitionable graphs. 755 - Yuanqiu Huang, Licheng Zhang, Yuxi Wang:
The matching extendability of 7-connected maximal 1-plane graphs. 777 - Heqin Liu, Dongqin Cheng:
The generalized 3-connectivity and 4-connectivity of crossed cube. 791
Volume 44, Number 3, 2024
- Mateusz Krzyzinski, Pawel Rzazewski, Szymon Tur:
Coloring squares of planar graphs with small maximum degree. 817 - Marisa Gutierrez, Silvia B. Tondato:
On walk domination: weakly toll domination, l2 and l3 domination. 837 - Julien Bensmail, Foivos Fioravantes:
On proper 2-labellings distinguishing by sums, multisets or products. 863 - Changchang Dong, Jixiang Meng, Juan Liu:
Dominated pair degree sum conditions of supereulerian digraphs. 879 - Yaser Rowshan:
The m-bipartite Ramsey number BRm(H1,H2). 893 - Yiling Dong, Gregory Z. Gutin, Yuefang Sun:
Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs. 913 - Abel Cabrera Martínez, José L. Sánchez, José María Sigarreta:
On the total domination number of total graphs. 933 - Zemin Jin, Junqi Gu:
Rainbow disjoint union of clique and matching in edge-colored complete graph. 953 - Hongzhang Chen, Jianxi Li, Shou-Jun Xu:
Spectral bounds for the zero forcing number of a graph. 971 - Aida Abiad, Hidde Koerts:
On the k-independence number of graph products. 983 - Lauren Keough, Darren B. Parker:
An extremal problem for the neighborhood Lights Out game. 997 - Asahi Takaoka:
Graph classes equivalent to 12-representable graphs. 1023 - Anna O. Ivanova, Oleg V. Borodin:
All tight descriptions of faces in plane triangulations with minimum degree 4. 1037 - Dwi Agustin Retnowardani, Mohammad Imam Utoyo, Dafik, Liliek Susilowati, Kamal Dliou:
A study of a combination of distance domination and resolvability in graphs. 1051 - Dongqin Cheng:
The generalized 4-connectivity of balanced hypercubes. 1079 - Yi-Zheng Fan, Hong-Xia Yang, Jian Zheng:
High-ordered spectral characterization of unicyclic graphs. 1107 - Colin Defant, David Dong, Alan Lee, Michelle Wei:
Connectedness and cycle spaces of friends-and-strangers graphs. 1143 - Maya G. S. Thankachy, S. V. Ullas Chandran, James Tuite, Elias John Thomas, Gabriele Di Stefano, Grahame Erskine:
On the vertex position number of graphs. 1169 - Christopher Duffy, Todd Mullen:
An analogue of quasi-transitivity for edge-coloured graphs. 1189 - Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Hypergraph operations preserving sc-greediness. 1217
Volume 44, Number 4, 2024
- Guantao Chen, Zhiquan Hu, Yaping Wu:
A Chvátal-Erdős type theorem for path-connectivity. 1247-1260 - Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh:
Total vertex product irregularity strength of graphs. 1261-1276 - Jing Tian, Sandi Klavzar:
Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products. 1277-1291 - David A. Kalarkop, Ismail Sahul Hamid, Mustapha Chellali, Raghavachar Rangarajan:
Global dominated coloring of graphs. 1293-1309 - Yuquan Lin, Wensong Lin:
Strong chromatic index of claw-free graphs with edge weight seven. 1311-1325 - Claude Tardif:
Chromatic Ramsey numbers of generalised Mycielski graphs. 1327-1339 - Sylvain Gravier, Hippolyte Signargout, Souad Slimani:
Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs. 1341-1359 - Paul Dorbec, Fatma Kaci:
Disjoint maximal independent sets in graphs and hypergraphs. 1361-1371 - Yi-Ping Liang, Jie Chen, Shou-Jun Xu:
Semitotal forcing in claw-free cubic graphs. 1373-1393 - Devvrit, Aaron Krim-Yee, Nithish Kumar, Gary MacGillivray, Ben Seamone, Virgélot Virgile, Anqi Xu:
Fractional eternal domination: securely distributing resources across a network. 1395-1428 - Lan Lei, Xiaomin Li, Sulin Song, Yikang Xie, Hong-Jian Lai:
Spanning trails avoiding and containing given edges. 1429-1447 - Deise L. de Oliveira, Danilo Artigas, Simone Dantas, Atílio G. Luiz:
On the edge-sum distinguishing game. 1449-1469 - Sylwia Cichacz, Agnieszka Görlich, Karol Suchan:
k-fault-tolerant graphs for p disjoint complete graphs of order c. 1471-1484 - Jishnu Sen, Srinivasa Rao Kola:
Critical aspects in broadcast domination. 1485-1512 - Jinghua Deng, Jianfeng Hou, Qinghou Zeng:
The Turán number of three disjoint paths. 1513-1537 - Dániel Gerbner:
On weakly Turán-good graphs. 1539-1550 - Saeid Alikhani, Davood Bakhshesh, Hamidreza Golmohammadi, Elena V. Konstantinova:
Connected coalitions in graphs. 1551-1566 - János Barát, Zoltán Blázsik:
General sharp upper bounds on the total coalition number. 1567-1584 - Jie Chen, Yi-Ping Liang, Shou-Jun Xu:
Semitotal domination in claw-free graphs. 1585-1605 - Mateusz Litka:
Online size Ramsey number for C4 and P6. 1607-1615 - Lingting Fu, Jian Wang, Weihua Yang:
The maximum number of edges in a Kr+1, Mk+1-free graph. 1617-1629 - Jan Goedgebeur, Thomas Gringore, Carol T. Zamfirescu:
On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs. 1631-1646
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-12-05 22:25 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:
