Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 42
Volume 42, Number 1, 2022
- Michitaka Furuya
, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima:
Degree sum condition for the existence of spanning k-trees in star-free graphs. 5-13 - Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli:
3-tuple total domination number of rook's graphs. 15-37 - Lucas Colucci, Ervin Györi:
On L(2, 1)-labelings of oriented graphs. 39-46 - Robin M. Givens, Gexin Yu, Rex K. Kincaid:
Open locating-dominating sets in circulant graphs. 47-62 - Danny Dyer, Jared Howell:
Bounds on watching and watching graph products. 63-79 - Jenq-Jong Lin, Min-Jen Jou:
Minimum coverings of crowns with cycles and stars. 81-88 - Pongpat Sittitrai, Kittikorn Nakprasit:
An analogue of DP-coloring for variable degeneracy and its applications. 89-99 - Bergfinnur Durhuus, Angelo Lucia:
Recursion relations for chromatic coefficients for graphs and hypergraphs. 101-121 - Drago Bokal, Janja Jerebic:
Guarding a subgraph as a tool in pursuit-evasion games. 123-138 - Douglas Klein, Juan A. Rodríguez-Velázquez:
Protection of lexicographic product graphs. 139-158 - Julien Bensmail, Fionn Mc Inerney, Kasper Szabo Lyngsie:
On {a, b}-edge-weightings of bipartite graphs with odd a, b. 159-185 - Wei Zheng, Hajo Broersma, Ligong Wang:
Toughness, forbidden subgraphs, and Hamiltonian-connected graphs. 187-196 - Jing Wang, Junliang Cai, Shengxiang Lv, Yuanqiu Huang:
The crossing number of hexagonal graph H3, n in the projective plane. 197-218 - Mahdieh Hasheminezhad, Brendan D. McKay:
Asymptotic enumeration of non-uniform linear hypergraphs. 219-230 - Michael A. Henning, Saikat Pal, Dinabandhu Pradhan:
The semitotal domination problem in block graphs. 231-248 - Arnfried Kemnitz, Massimiliano Marangio:
On the ρ-edge stability number of graphs. 249-262 - Jieyan Wang:
Packing trees in complete bipartite graphs. 263-275 - Winfried Hochstättler, Raphael Steiner:
The star dichromatic number. 277-298 - Mateusz Miotk, Pawel Zylinski:
Spanning trees with disjoint 2 dominating and 2-dominating sets. 299-308 - Elena Mohr, Dieter Rautenbach:
On Hamiltonian cycles in claw-free cubic graphs. 309-313 - Péter G. N. Szabó:
Corrigendum to: Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees [Discussiones Mathematicae Graph Theory, 36 (2016) 259-278]. 315-316
Volume 42, Number 2, 2022
- Yaoyao Zhang, Jixiang Meng:
On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs. 321-332 - Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero:
Further results on packing related parameters in graphs. 333-348 - Xihe Li, Ligong Wang:
Gallai-Ramsey numbers for rainbow S+3 and monochromatic paths. 349-362 - S. Francis Raj, M. Gokulnath:
b-coloring of the Mycielskian of some classes of graphs. 363-381 - Joanna N. Chen, Sergey Kitaev:
On the 12-representability of induced subgraphs of a grid graph. 383-403 - Jen-Ling Shang:
Branch-weight unique trees. 405-416 - Xia Liu, Liming Xiong:
Forbidden subgraphs for collapsible graphs and supereulerian graphs. 417-442 - Alice Joffard, Hamamache Kheddouci:
Labeled packing of cycles and circuits. 443-469 - Maria Axenovich, Annette Karrer:
High girth hypergraphs with unavoidable monochromatic or rainbow edges. 471-484 - Fengxia Liu, Baoyindureng Wu, Jixiang Meng:
Arbitrarily partitionable 2K2, C4-free graphs. 485-500 - Stephan Andres, Clément Charpentier, Wai Fong:
Game-perfect semiorientations of forests. 501-534 - Martin Baca, Ali Ovais, Andrea Semanicová-Fenovcíková, I Nengah Suparta:
On face irregular evaluations of plane graphs. 549-568 - Bostjan Bresar, Jasmina Ferme:
Graphs that are critical for the packing chromatic number. 569-589 - Mauro Mezzini:
An O(mn2) algorithm for computing the strong geodetic number in outerplanar graphs. 591-599 - Emma Guzman-Garcia, Rocío Sánchez-López:
Corrigendum to: independent transversal domination in graphs [Discuss. Math. Graph Theory 32 (2012) 5-17]. 601-611 - Majid Hajian, Michael A. Henning, Nader Jafari Rad:
A classification of cactus graphs according to their domination number. 613-626 - Kirsti Kuenzel, Douglas F. Rall:
On well-covered direct products. 627-640 - Hangdi Chen, Changhong Lu:
Roman 2-domination problem in graphs. 641-660
Volume 42, Number 3, 2022
- Michael A. Henning:
Bounds on domination parameters in graphs: a brief survey. 665-708 - Abolfazl Poureidi, Nader Jafari Rad:
Algorithmic aspects of the independent 2-rainbow domination number and independent Roman 2-domination number. 709-726 - Fan Yang, Liangchen Li, Sizhong Zhou:
Nowhere-zero unoriented 6-flows on certain triangular graphs. 727-746 - Shonda Dueck:
Cyclic partitions of complete and almost complete uniform hypergraphs. 747-758 - Yuefang Sun, Zemin Jin:
Minimally strong subgraph (k, ℓ)-arc-connected digraphs. 759-770 - Zuosong Liang:
Total coloring of claw-free planar graphs. 771-777 - Dragana Bozovic, Iztok Peterin:
Graphs with unique maximum packing of closed neighborhoods. 779-797 - Anna Nenca:
Oriented chromatic number for Cartesian products Pm☐Pn and Cm☐Pn. 799-810 - Andrea Austin, Brian C. Wagner:
Ascending subgraph decompositions of oriented graphs that factor into triangles. 811-822 - Cafer Çaliskan, Stefko Miklavic, Sibel Özkan, Primoz Sparl:
Efficient domination in Cayley graphs of generalized dihedral groups. 823-841 - Xiaojing Yang, Liming Xiong:
Hamiltonian extendable graphs. 843-859 - Mustapha Chellali, Nader Jafari Rad, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The Roman domatic problem in graphs and digraphs: a survey. 861-891 - Zoran Stanic:
Some properties of the eigenvalues of the net Laplacian matrix of a signed graph. 893-903 - Tjasa Paj Erker, Simon Spacapan:
Separation of Cartesian products of graphs into several connected components by the removal of vertices. 905-920 - Yair Caro, Randy Davila, Ryan Pepper:
New results relating inependence and matchings. 921-935 - Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Juan Carlos Valenzuela Tripodoro:
Total Roman 2-dominating functions in graphs. 937-958 - Antoni Lozano, Mercè Mora, Carlos Seara, Joaquín Tey:
Trees whose even-degree vertices induce a path are antimagic. 959-966 - Abel Cabrera Martínez, Juan Alberto Rodríguez-Velázquez:
Total protection of lexicographic product graphs. 967-984 - Zhenhua Lyu:
Extremal digraphs avoiding distinct walks of length 4 with the same endpoints. 985-1004 - Sakineh Nazari-Moghaddam, Mustapha Chellali:
A new upper bound for the perfect Italian domination number of a tree. 1005-1022
Volume 42, Number 4, 2022
- Fendy Septyanto, Kiki A. Sugeng:
Distance-local rainbow connection number. 1027-1039 - Daiki Ikegami, Atsuhiro Nakamoto:
Flippable edges in triangulations on surfaces. 1041-1059 - Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Singular Turán numbers and WORM-colorings. 1061-1074 - Jaroslav Ivanco, Alfred Onderko:
On Mf-edge colorings of graphs. 1075-1088 - Mengmeng Xie, Chuixiang Zhou:
Decomposing 10-regular graphs into paths of length 5. 1089-1097 - Hadi Alizadeh, Didem Gözüpek, Gülnaz Boruzanli Ekinci:
(C3, C4, C5, C7)-free almost well-dominated graphs. 1099-1117 - Shasha Li, Jianhua Yin, Jiayun Li:
The Turán number for 4·Sℓ. 1119-1128 - Farzaneh Azvin, Nader Jafari Rad:
Bounds on the double Italian domination number of a graph. 1129-1137 - Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in P9-free graphs in polynomial time. 1139-1162 - Marián Klesc, Michal Stas:
Cyclic permutations in determining crossing numbers. 1163-1183 - Xuqing Bai, Renying Chang, Zhong Huang, Xueliang Li:
More on the rainbow disconnection in graphs. 1185-1204 - Kecai Deng, Yunfei Li:
Antimagic labeling of some biregular bipartite graphs. 1205-1218 - Yair Caro, Josef Lauri, Christina Zarb:
On small balanceable, strongly-balanceable and omnitonal graphs. 1219-1235 - Julien Bensmail, Binlong Li:
More aspects of arbitrarily partitionable graphs. 1237-1261 - Herman Z. Q. Chen, Sergey Kitaev, Akira Saito:
Representing split graphs by words. 1263-1280 - Johan P. de Wet, Marietjie Frick:
Nested locally Hamiltonian graphs and the Oberly-Sumner Conjecture. 1281-1312 - Farzaneh Ramezani, Peter Rowlinson, Zoran Stanic:
More on signed graphs with at most three eigenvalues. 1313-1331 - Vojtech Rödl, Andrzej Rucinski:
Covering the edges of a random hypergraph by cliques. 1333-1349 - Nino Basic, Patrick W. Fowler, Tomaz Pisanski, Irene Sciriha:
On singular signed graphs with nullspace spanned by a full vector: signed nut graphs. 1351-1382 - Jerzy Konarski, Mariusz Wozniak, Andrzej Zak:
A note on packing of uniform hypergraphs. 1383-1388
a service of 
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-04-25 05:29 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:
