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 A. 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
Volume 43, Number 3, 2023
- Doost Ali Mojdeh, Babak Samadi:
Total 2-domination number in digraphs and its dual parameter. 587-606 - Louis DeBiasio, Robert A. Krueger:
A note about monochromatic components in graphs of large minimum degree. 607-618 - Randy Davila, Michael A. Henning, Ryan Pepper:
Zero and total forcing dense graphs. 619-634 - Zhen-Kun Zhang:
Edge-maximal graphs with cutwidth at most three. 635-657 - Liliana Alcón, Marisa Gutierrez, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
The neighbor-locating-chromatic number of trees and unicyclic graphs. 659-675 - Zdzislaw Skupien:
The Petersen and Heawood graphs make up graphical twins via induced matchings. 677-683 - Peter Dankelmann, Matthew DeVilbiss, David J. Erwin, Kelly Guest, Ryan Matzke:
On subgraphs with prescribed eccentricities. 685-702 - Dmitri V. Karpov:
An upper bound on the chromatic number of 2-planar graphs. 703-720 - Lutz Volkmann:
Double Roman and double Italian domination. 721-730 - Xiaomin Zhou, Weihua Yang, Xiaxia Guan, Chengfu Qin:
A characterization of internally 4-connected {P10 - {V1, V2}}-minor-free graphs. 731-742 - Jean-Christophe Godin, Olivier Togni:
Choosability with separation of cycles and outerplanar graphs. 743-760 - Sizhong Zhou, Qiuxiang Bian, Zhiren Sun:
Two sufficient conditions for component factors in graphs. 761-766 - Fred M. Abdelmalek, Esther Vander Meulen, Kevin N. Vander Meulen, Adam Van Tuyl:
Well-covered token graphs. 767-792 - Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons:
Minimizing the number of complete bipartite graphs in a Ks-saturated graph. 793-807 - Jochen Harant, Samuel Mohr:
New bounds on domination and independence in graphs. 809-824 - Michael A. Henning, Saikat Pal, Dinabandhu Pradhan:
Hop domination in chordal bipartite graphs. 825-840 - Liliana Alcón, María Pía Mazzoleni, Tanilson D. Santos:
Relationship among B1-EPG, VPT and EPT graphs classes. 841-858 - MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann:
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs. 859-874
Volume 43, Number 4, 2023
- Simone Dantas, Rodrigo Marinho, Myriam Preissmann, Diana Sasaki:
New results on Type 2 snarks. 879-893 - Sopon Boriboon, Teeradej Kittipassorn:
The graph grabbing game on blow-ups of trees and cycles. 895-907 - Stephan Dominique Andres:
Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs. 909-930 - Teresa W. Haynes, Jason Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan:
Coalition graphs of paths, cycles, and trees. 931-946 - Subhabrata Paul, Dinabandhu Pradhan, Shaily Verma:
Vertex-edge domination in interval and bipartite permutation graphs. 947-963 - Wenyao Song, Lianying Miao, Yueying Zhao, Haiyang Zhu:
Acyclic chromatic index of IC-planar graphs. 965-978 - Arnfried Kemnitz, Massimiliano Marangio:
On the ρ-subdivision number of graphs. 979-997 - Péter G. N. Szabó:
A characterization of uniquely representable graphs. 999-1017 - Zbigniew R. Bogdanowicz:
On q-connected chordal graphs with minimum number of spanning trees. 1019-1032 - Guoliang Hao, Zhihong Xie, Seyed Mahmoud Sheikholeslami, M. Hajjari:
Bounds on the total double Roman domination number of graphs. 1033-1061 - Hayat Issaadi, Hacène Aït Haddadène, Hamamache Kheddouci:
On P5-free locally split graphs. 1063-1090 - Mateja Sajna, Andrew Wagner:
ℓ-covering k-hypergraphs are quasi-eulerian. 1091-1102 - Mirko Hornák:
The achromatic number of K6 square Kq equals 2q+3 if q≥41 is odd. 1103-1121 - Soogang Eoh, Myungho Choi, Suh-Ryung Kim:
The niche graphs of multipartite tournaments. 1123-1146 - Aleksandra Gorzkowska, Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz:
Total and paired domination stability in prisms. 1147-1169 - Gabriela Araujo-Pardo, Fidel Barrera-Cruz, Natalia García-Colín:
Biregular (and regular) planar cages. 1171-1194 - Dang Hanh:
Spanning trees with a bounded number of branch vertices in a K1, 4-free graph. 1195-1202 - Stefan Ehard, Elena Mohr, Dieter Rautenbach:
Biholes in balanced bipartite graphs. 1203-1213 - Mehmet Akif Yetim:
L(p, q)-labeling of graphs with interval representations. 1215-1235 - Claudson F. Bornstein, Gila Morgenstern, Tanilson D. Santos, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Helly and strong Helly numbers of Bk-EPG and Bk-VPG graphs. 1237-1252 - Yanhong Gao, Ping Li, Xueliang Li:
Extremal graphs and classification of planar graphs by MC-numbers. 1253-1272
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-12-15 01:17 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:
