default search action
Discussiones Mathematicae Graph Theory, Volume 38
Volume 38, Number 1, 2018
- Daphne Der-Fen Liu, Ziyu Hu, Ko-Wei Lih:
Upper bounds for the strong chromatic index of Halin graphs. 5-26 - Kamyar Mirzavaziri, Madjid Mirzavaziri, Mohammad Hadi Shekarriz:
A characterization for 2-self-centered graphs. 27-37 - Manoj Changat
, Ferdoss Hossein Nezhad
A note on the interval function of a disconnected graph. 39-48 - Nader Jafari Rad
Bounds on the locating Roman dominating number in trees. 49-62 - Andreas M. Hinz, Seethu Varghese, Ambat Vijayakumar:
Power domination in Knödel graphs and Hanoi graphs. 63-74 - Saieed Akbari
Cubic graphs with total domatic number at least two. 75-82 - Ivan Gutman, Xueliang Li, Yaping Mao
Inverse problem on the Steiner Wiener index. 83-95 - Sylwia Cichacz
Constant sum partition of sets of integers and distance magic graphs. 97-106 - Robert Janczewski, Anna Malafiejska, Michal Malafiejski
On incidence coloring of complete multipartite and semicubic bipartite graphs. 107-119 - Urszula Bednarz
Fibonacci and telephone numbers in extremal trees. 121-133 - Subramanian Arumugam
The distance magic index od a graph. 135-142 - Wenjing Li, Xueliang Li, Jingshu Zhang:
Rainbow vertex-connection and forbidden subgraphs. 143-154 - Yang Gao, Heping Zhang
Sharp upper bounds on the Clar number of fullerene graphs. 155-163 - Ligang Jin, Giuseppe Mazzuoccolo
Cores, joins and the Fano-flow conjectures. 165-175 - Christian Barrientos, Sarah M. Minion:
On the number of α-labeled graphs. 177-188 - Yixun Lin, Xiumei Wang:
Core index of perfect matching polytope for a 2-connected cubic graph. 189-201 - Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Domination parameters of a graph and its complement. 203-215 - Fan Wang, Weisheng Zhao:
Matchings extend to Hamiltonian cycles in 5-cube. 217-231 - Wei Li:
The graphs whose permanental polynomials are symmetric. 233-243 - Zemin Jin, Fengwei Li, Yuefang Sun
On two generalized connectivities of graphs. 245-261 - Terry A. McKee:
Requiring that minimal separators induce complete multipartite subgraphs. 263-273 - Michael A. Henning, Simon Jäger, Dieter Rautenbach:
Hereditary equality of domination and exponential domination. 275-285 - Dorota Kuziak
Bounding the open k-monopoly number of strong product graphs. 287-299 - Sergio Bermudo
On the total k-domination in graphs. 301-317
Volume 38, Number 2, 2018
- Mieczyslaw Borowiecki
P-apex graphs. 323-349 - Yuanqiu Huang, Zhangdong Ouyang, Jing Wang:
The crossing number of join of the generalized Petersen graph P(3, 1) with path and cycle. 351-370 - Xueliang Li, Colton Magnant, Meiqin Wei, Xiaoyu Zhu:
Generalized rainbow connection of graphs and their complements. 371-384 - Yun-Ping Deng, Haichao Wang, Yancai Zhao:
The complexity od secure domination problem in graphs. 385-396 - Shahab Haghi, Hamid Reza Maimani:
A note on the Ramsey number of even wheels versus stars. 397-404 - Olga Bodroza-Pantic
A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs. 405-427 - Lingping Zhong:
The minimum harmonic index for unicyclic graphs with given diameter. 429-442 - Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova
More about the height of faces in 3-polytopes. 443-453 - Nader Jafari Rad
Bounds on the locating-domination number and differentiating-total domination number in trees. 455-462 - Mirko Hornák
On the palette index of complete bipartite graphs. 463-476 - Tingting Han, Ruijuan Li:
Arc-disjont Hamiltonian cycles in round decomposable locally semicomplete digraphs. 477-490 - Fuhong Ma, Jin Yan:
On the number of disjoint 4-cycles in regular tournaments. 491-498 - R. Rasi, Seyed Mahmoud Sheikholeslami:
The smallest harmonic index of trees with given maximum degree. 499-513 - Mohammad Reza Oboudi
Some results on the independence polynomial of unicyclic graphs. 515-524 - Nibedita Mandal
Irreducible no-hole L(2, 1)-coloring of edge-multiplicity-paths-replacement graph. 525-552 - Sally Cockburn:
Homomorphic preimages of geometric paths. 553-571 - Joanna Cyman
Total domination in versus paired-domination in regular graphs. 573-586 - Zhenming Bi, Gary Chartrand, Ping Zhang:
Another view of bipartite Ramsey numbers. 587-605 - Adam Pawel Wojda:
Almost self-complementary uniform hypergraphs. 607-610
Volume 38, Number 3, 2018
- Oleg V. Borodin, Anna O. Ivanova
Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11. 615-625 - Bedrane Amari, Abdelhafid Berrachedi:
Generalized Hamming graphs: some new results. 627-633 - Erika Fecková Skrabul'áková
A note on the Thue chromatic number of lexicographic produts of graphs. 635-643 - Sahar A. Aleid, José Cáceres, María Luz Puertas:
On independent [1, 2]-sets in trees. 645-660 - Pavel Hrnciar, Gabriela Monoszová:
Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two. 661-681 - Rikio Ichishima, Susana-Clara López, Francesc Antoni Muntaner-Batle, Akito Oshima:
On the beta-number of forests with isomorphic components. 683-701 - Michelle Edwards, Gary MacGillivray, Shahla Nasserasr:
Reconfiguring minimum dominating sets: the ?-graph of a tree. 703-716 - Henry Liu, Teresa Sousa:
Turán function and H-decomposition problem for gem graphs. 717-741 - Youssef Boudabbous
The {-2, -1}-selfdual and decomposable tournaments. 743-789 - Zyta Dziechcinska-Halamoda, Joanna Górska, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien:
Extremal irregular digraphs. 791-800 - Xia Hong:
Completely independent spanning trees in k-th power of graphs. 801-810 - Liying Kang, Erfang Shan:
Trees with unique least central subtrees. 811-828 - Aijun Dong, Xin Zhang
Equitable coloring and equitable choosability of graphs with small maximum average degree. 829-839 - Zoran Stanic
Perturbations in a signed graph and its index. 841-852 - Saeid Alikhani
The distinguishing number and distinguishing index of the lexicographic product of two graphs. 853-865
Volume 38, Number 4, 2018
- Marc Besson
Tr-span of directed wheel graphs. 871-888 - Y. M. Borse, Ganesh Mundhe:
Graphic and cographic Γ-extensions of binary matroids. 889-898 - Zongpeng Ding, Yuanqiu Huang:
The crossing numbers of join of some graphs with n isolated vertices. 899-909 - Július Czap
Conflict -free connections of graphs. 911-920 - Bin Wang, Longmin Wang, Kai-Nan Xiang:
The largest component in critical random intersection graphs. 921-946 - Hengzhe Li, Baoyindureng Wu, Weihua Yang:
Making a dominating set of a graph connected. 947-962 - Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic:
On total domination in the Cartesian product of graphs. 963-976 - Lin Sun, Bing Wang, Jian-Liang Wu:
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles. 977-989 - Hamideh Aram, Maryam Atapour
Eternal m-security bondage numbers in graphs. 991-1006 - Gary Chartrand, Stephen Devereaux, Teresa W. Haynes, Stephen T. Hedetniemi, Ping Zhang:
Rainbow disconnection in graphs. 1007-1021 - Zemin Jin, Yuefang Sun
Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number. 1023-1036 - Samia Kerdjoudj, Alexandr V. Kostochka, André Raspaud:
List star edge-coloring of subcubic graphs. 1037-1054
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-11-28 20:20 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: