Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 43
Volume 43, Number 1, 2023
- Guowei Dai
:
The existence of path-factor covered graphs. 5-16
- J. B. Saraf, Y. M. Borse, Ganesh Mundhe:
On conditional connectivity of the Cartesian product of cycles. 17-34 - Teresa W. Haynes, Michael A. Henning:
Unique minimum semipaired dominating sets in trees. 35-53 - Jacob White:
Burnside chromatic polynomials of group-invariant graphs. 55-76 - Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Equimatchable bipartite graphs. 77-94 - Amanda Burcroff:
Domination parameters of the unitary Cayley graph of ℤ/nℤ. 95-114 - William Klostermeyer, Gary MacGillivray, Saeed Semnani, Farzaneh Piri:
Efficient (j, k)-dominating functions. 115-135 - Jaume Martí-Farré, Mercè Mora, María Luz Puertas, José Luis Ruiz:
Elimination properties for minimal dominating sets of graphs. 137-149 - Kenny Storgel:
Improved bounds for some facially constrained colorings. 151-158 - Pawel Wocjan, Clive Elphick, David Anekstein:
More tales of Hoffman: bounds for the vector chromatic number of a graph. 159-169 - Hikari Shibuya, Yusuke Suzuki:
A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces. 171-177 - Yingzhi Tian, Hong-Jian Lai, Jixiang Meng, Murong Xu:
On the sizes of (k, l)-edge-maximal r-uniform hypergraphs. 179-194 - Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann:
The threshold dimension and irreducible graphs. 195-210 - Xiaojing Yang, Liming Xiong:
Forbidden subgraphs for existences of (connected) 2-factors of a graph. 211-224 - Linda M. Lesniak, Henri Thuiller, Adam Pawel Wojda:
Extending Poto?nik and ?ajna's conditions on the existence of vertex-transitive self-complementary k-hypergraphs. 225-231 - Sizhong Zhou:
Some results on path-factor critical avoidable graphs. 233-244 - Anni Hakanen, Ville Junnila, Tero Laihonen, María Luz Puertas:
On the metric dimensions for sets of vertices. 245-275 - Peter Borg, Carl Feghali:
The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem. 277-286 - Sarawute Sribunhung, Keaitsuda Nakprasit, Kittikorn Nakprasit, Pongpat Sittitrai:
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles. 287-297
Volume 43, Number 2, 2023
- Lin-Peng Zhang, Ligong Wang, Jiale Zhou:
The Turán number of spanning star forests. 303-312 - Tijo James, Ambat Vijayakumar:
Domination game: Effect of edge contraction and edge subdivision. 313-329 - Roland Lortz, Ingrid Mengersen:
On the Ramsey numbers of non-star trees versus connected graphs of order six. 331-349 - Flor Aguilar-Campos, Gabriela Araujo-Pardo, Natalia García-Colín:
Scaffold for the polyhedral embedding of cubic graphs. 351-384 - Arman Aashtab, Saieed Akbari, Maryam Ghanbari, Amitis Shidani:
Vertex partitioning of graphs into odd induced subgraphs. 385-399 - Gyula Y. Katona, Kitti Varga:
Strengthening some complexity results on toughness of graphs. 401-419 - Tanja Dravec, Andrej Taranenko:
Daisy Hamming graphs. 421-436 - Jianhua Yin, Bing Wang:
About an extremal problem of bigraphic pairs with a realization containing Ks, t. 437-444 - Devin C. Jean, Suk Jai Seo:
Optimal error-detecting open-locating-dominating set on the infinite triangular grid. 445-455 - Shimon Kogan:
A note on forcing 3-repetitions in degree sequences. 457-462 - Neeta Shinde, Smruti Mane, Baloo Waphare:
Identifying codes in the direct product of a path and a complete graph. 463-486 - Peter Dankelmann, Jane Morgan, Emily Rivett-Carnac:
Metric dimension and diameter in bipartite graphs. 487-498 - John Haslegrave:
Countable graphs are majority 3-choosable. 499-506 - Irene Sciriha, Luke Collins:
The walks and CDC of graphs with the same main eigenspace. 507-532 - Sergey Kitaev, Artem V. Pyatkin:
On semi-transitive orientability of triangle-free graphs. 533-547 - Dániel Gerbner:
Generalized Turán problems for small graphs. 549-572 - Ngo Dac Tan:
A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths. 573-581
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 2023-02-01 21:32 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:
