Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 39
Volume 39, Number 1, 2019
- Gülnaz Boruzanli Ekinci, John Baptist Gauci:
The super-connectivity of Kneser graphs. 5-11 - Xiaodan Chen, Guoliang Hao, Zhihong Xie:
A note on Roman domination of digraphs. 13-21 - Jing-Xin Guan, Jian-Hua Yin:
The bipartite-splittance of a bipartite graph. 23-29 - Mei Lu, Wenjie Ning, Kun Wang:
Bounding the locating-total domination number of a tree in terms of its annihilation number. 31-40 - Nader Jafari Rad
, Hadi Rahbani:
Some progress on the double Roman domination in graphs. 41-53 - Yongtang Shi, Jianhua Tu:
An efficient polynomial time approximation scheme for the vertex cover P 3 problem on planar graphs. 55-65 - Xiaodan Chen, Guoliang Hao, Lutz Volkmann:
Bounds on the signed Roman k-domination number of a digraph. 67-79 - Mirko Hornák, Stanislav Jendrol', Roman Soták:
Facial incidence colorings of embedded multigraphs. 81-93 - Shiying Wang, Guozhen Zhang:
Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity. 95-116 - Yutaro Sakamoto:
Hamilton cycles in double generalized Petersen graphs. 117-123 - Han Ren, Chao Yang:
New formulae for the decycling number of graphs. 125-141 - Ronald J. Gould, Paul Horn, Michael S. Jacobson, Brent J. Thomas:
Gaps in the saturation spectrum of trees. 157-170 - Thomas M. Lewis:
On the Hamiltonian number of a plane graph. 171-181 - Rong-Xia Hao, Yuan Yuan:
Independence number, connectivity and all fractional (a, b, k)-critical graphs. 183-190 - Christopher Duffy, Gary MacGillivray, Pascal Ochem, André Raspaud:
Oriented incidence colourings of digraphs. 191-210 - Janusz Dybizbanski, Anna Nenca:
Oriented chromatic number of Cartesian products and strong products of paths. 211-223 - Wayne Goddard, Robert Melville, Honghai Xu:
Almost injective colorings. 225-239 - Y. M. Borse, S. R. Shaikh:
Decomposition of the product of cycles based on degree partition. 241-256 - Roger K. Yeh:
Pair L(2, 1)-labelings of infinite graphs. 257-269 - Soumya Bhoumik, Sarbari Mitra:
L(2, 1)-labeling of circulant graphs. 257-269 - Douglas B. West, Jennifer Wise:
Antipodal edge-colorings of hypercubes. 271-284 - Izolda Gorgol, Anna Lechowska:
Anti-Ramsey number of Hanoi graphs. 285-296
Volume 39, Number 2, 2019
- Lin Sun, Jian-Liang Wu:
On edge colorings of 1-planar graphs without 5-cycles with two chords. 301-312 - Mohammed Benatallah, Noureddine Ikhlef Eschouf, Miloud Mihoubi:
On the b-domatic number of graphs. 313-324 - M. Rajeswari, Ismail Sahul Hamid:
Global dominator coloring of graphs. 325-339 - Robert Bailey, Ismael González Yero:
Error-correcting codes from k-resolving sets. 341-355 - Nastaran Haghparast, Dariush Kiani:
Edge-connectivity and edges of even factors of graphs. 357-364 - Terry A. McKee:
Strongly unichord-free graphs. 365-374 - Yelena Mandelshtam:
On graphs presentable by pattern-avoiding words. 375-389 - Simon Spacapan:
On 3-colorings of direct products of graphs. 391-413 - Dan Pillone:
Arankings of trees. 415-437 - Norbert Polat:
On some characterizations of antipodal partial cubes. 439-453 - Zehui Shao, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi, Lutz Volkmann, Xinmiao Liu:
On the co-Roman domination in graphs. 455-472 - Kefeng Diao, Fuliang Lu, Ping Zhao:
More results on the smallest one-realization of a given set II. 473-487 - Majid Hajian, Nader Jafari Rad:
Fair domination number in cactus graphs. 489-503 - H. S. Boregowda, B. Chaluvaraju, V. R. Kulli:
The product connectivity Banhatti index of a graph. 505-517 - Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi:
On the total Roman domination in trees. 519-532 - Sylwia Cichacz, Bryan J. Freyberg, Dalibor Froncek:
Orientable ℤn-distance magic graphs. 533-546 - Yuanqiu Huang, Zhangdong Ouyang, Jing Wang:
The crossing number of the hexagonal graph H3, n. 547-554 - Ruijuan Li, Bin Sheng:
The second neighbourhood for bipartite tournaments. 555-565 - Lutz Volkmann:
Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number. 567-573 - Robert A. Beeler, Teresa W. Haynes, Kyle Murphy:
1-restricted optimal rubbling on graphs. 575-588 - Brahim Benmedjdoub, Isma Bouchemakh, Éric Sopena:
2-distance colorings of integer distance graphs. 589-603 - Allan Bickle, Allen J. Schwenk:
Minimum edge cuts in diameter 2 graphs. 605-608
Volume 39, Number 3, 2019
- Joanna Cyman, Michael A. Henning, Jerzy Topp:
On accurate domination in graphs. 615-627 - Július Czap, Stanislav Jendrol', Peter Sugerek, Juraj Valiska:
Facial [r.s, t]-colorings of plane graphs. 629-645 - Izolda Gorgol:
On lower bound for induced Ramsey numbers. 647-654 - Jochen Harant, Samuel Mohr:
On Selkow's bound on the independence number of graphs. 655-657 - Teresa W. Haynes, Michael A. Henning:
Graphs with large semipared domination number. 659-671 - Pawaton Kaemawichanurat:
Hamiltonicities of double domination critical and stable claw-free graphs. 673-687 - Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt:
Generalized sum list colorings of graphs. 689-703 - Ruxandra Marinescu-Ghemeci:
On radio connection number of graphs. 705-730 - Anahy Santiago Arguello, Juan José Montellano-Ballesteros:
Hamiltonian normal Cayley graphs. 731-740 - Monika Rosicka:
Convex and weakly convex domination in prism graphs. 741-755 - Edy Tri Baskoro, Denny Riama Silaban, Saladin Uttunggadewa:
On the restricted size Ramsey number involving a path P3. 757-769
Volume 39, Number 4, 2019
- Hui Jiang, Xueliang Li, Yingying Zhang:
Erdős-Gallai-type results for total monochromatic connection of graphs. 775-785 - Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Mustapha Chellali, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami:
Total Roman reinforcement in graphs. 787-803 - Yongxin Lan, Zhongmei Qin, Yongtang Shi:
The Turán number of 2P7. 805-814 - Ryan C. Bunge, Brian D. Darrow, Toni M. Dubczuk, Saad I. El-Zanati, Hanson H. Hao, Gregory L. Keller, Genevieve A. Newkirk, Dan P. Roberts:
On decomposing the complete symmetric digraph into orientations of K4-e. 815-828 - Magda Dettlaff, Joanna Raczek, Jerzy Topp:
Domination subdivision and domination multisubdivision numbers of graph. 829-839 - Gholamreza Abrishami, Michael A. Henning, Freydoon Rahbarnia:
On independent domination in planar, cubic graphs. 841-853 - Camino Balbuena, Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
About (k, l)-kernels, semikernels and Grundy functions in partial line digraphs. 855-866 - Vladislav Taranchuk:
Pancyclity when each cycle contains k chords. 867-879 - Xueliang Li, Xiaoyu Zhu:
Kaleidoscopic edge-coloring of complete graphs and r-regular graphs. 881-888 - Stanislav Jendrol', Lucia Kekenáková:
Facial rainbow coloring of plane graphs. 889-897 - Radhika Ramamurthi, Gina Sanders:
Star coloring outerplanar bipartite graphs. 899-916 - Adam S. Jobson, André E. Kézdy, Jeno Lehel, Gábor Mészáros:
The path-pairability number of products of stars. 909-924 - Shipeng Wang, Liming Xiong:
On the independence number of traceable 2-connected claw-free graphs. 925-937 - Meilian Liang, Stanislaw P. Radziszowski, Xiaodong Xu:
A note on upper bounds for some generalized Folkman numbers. 937-950 - Gaixiang Cai, Yi-Zheng Fan, Yi Fang, Gui-Dong Yu:
Spectral radius and Hamiltonicity of graphs. 951-974
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-19 19:21 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:
