default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 41
Volume 41, Number 1, 2021
- Július Czap
, Mirko Hornák, Stanislav Jendrol':
A survey on the cyclic coloring and its relaxations. 5-38 - Hamideh Aram, Nasrin Dehgardi, Seyed Mahmoud Sheikholeslami, Mina Valinavaz, Lutz Volkmann:
Domination, independent domination number and 2-independence number in trees. 39-49 - Ming Chen, Yusheng Li, Li Zhang:
Linear list coloring of some sparse graph. 51-64 - Tomás Madaras, Pavol Siroczki:
Minimal graphs with respect to geometric distance realizability. 65-73 - Qiaoping Guo, Wei Meng:
On the n-partite tournaments with exactly n-m+1 cycles of length m. 75-82 - Dmitri V. Karpov:
Large contractible subgraphs of a 3-connected graph. 83-101 - Thomas Schweser:
Generalized hypergraph coloring. 103-121 - William F. Klostermeyer, Margaret-Ellen Messinger, Anders Yeo:
Dominating vertex covers: the vertex-edge domination problem. 123-132 - Gee-Choon Lau, Ho-Kuen Ng, Wai-Chee Shiu:
On local antimagic chromatic number of cycle-related join graphs. 133-152 - N. R. Aravind, C. R. Subramanian:
Intersection dimension and graph invariants. 153-166 - Ligong Wang, Wojciech Widel, Wei Zheng:
On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs. 167-181 - Yuanqiu Huang, Yuxi Wang:
The crossing number of Cartesian product of 5-wheels with any tree. 183-197 - Linna Hu, Lei Sun, Jian-Liang Wu:
List edge coloring of planar graphs without 6-cycles with two chords. 199-211 - Abel Cabrera Martínez, Iztok Peterin, Ismael González Yero:
Independent transversal total domination versus total domination in trees. 213-224 - Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On Grundy total domination number in product graphs. 225-247 - P. Paulraja, R. Srimathi:
Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6. 249-266 - Abel Cabrera Martínez, Dorota Kuziak, Ismael González Yero:
A constructive characterization of vertex cover Roman trees. 267-283 - Terry A. McKee:
Dualizing distance-hereditary graphs. 285-296 - Wei Meng:
Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments. 297-310 - Leonid Plachta:
Coverings of cubic graphs and 3-edge colorability. 311-334 - Richard H. Hammack:
Graph exponentiation and neighborhood reconstruction. 335-339
Volume 41, Number 2, 2021
- Hossein Abdollahzadeh Ahangar, Jafar Amjadi, Mustapha Chellali, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami:
Total 2-rainbow domination numbers in trees. 345-364 - Vladimir Samodivkin:
Changing and unchanging of the domination number of a graph: path addition numbers. 365-379 - Chula J. Jayawardene, David E. Narváez, Stanislaw P. Radziszowski:
Star-critical Ramsey numbers for cycles versus K4. 381-390 - José Manuel Campero-Alonzo, Rocío Sánchez-López:
H-kernels in unions of H-colored quasi-transitive digraphs. 391-408 - Zemin Jin, Bin Sheng, Yuefang Sun:
The minimum size of a graph with given tree connectivity. 409-425 - Zehui Shao, Enqiang Zhu:
On the star chromatic index of generalized Petersen graphs. 427-439 - Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski:
T-colorings, divisibility and circular chromatic number. 441-450 - Tay-Woei Shyu:
Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each. 451-468 - Hui Jiang, Wenjing Li, Xueliang Li, Colton Magnant:
On proper (strong) rainbow connection of graphs. 469-479 - Nawarat Ananchuen, Chanun Lewchalermvongs:
Internally 4-connected graphs with no {CUBE, V8}-minor. 481-501 - Edita Mácajová, Martin Skoviera:
Critical and flow-critical snarks coincide. 503-511 - Xueliang Li, Hengzhe Li, Yingbin Ma:
The vertex- rainbow connection number of some graph operations. 513-530 - Bei Niu, Xin Zhang:
On (p, 1)-total labelling of some 1-planar graphs. 531-558 - Hajo Broersma, Qin Ma, Yaping Mao, Jichang Wu:
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph. 559-587 - Nina Zublirina:
Asymptotic behavior of the edge metric dimension of the random graph. 589-599 - Angsuman Das:
Triameter of graphs. 601-616 - Trung Duy Doan, Ingo Schiermeyer:
Conflict-free vertex connection number at most 3 and size of graphs. 617-632 - Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Restrained domination in self-complementary graphs. 633-645 - Majid Hajian, Nader Jafari Rad:
Fair total domination number in cactus graphs. 647-664 - Christina M. Mynhardt, Joanna Raczek:
Block graphs with large paired domination multisubdivision number. 665-684 - Ruixia Wang:
Hamilton cycle problem in strong k-quasi-transitive digraphs with large diameter. 685-690
Volume 41, Number 3, 2021
- Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface 2019. 695-695 - Maryam Alipour, Peter Tittmann:
Graph operations and neighborhood polynomials. 697-711 - Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen, Christian Rubio-Montiel:
Achromatic numbers for circulant graphs and digraphs. 713-724 - Ez-Zobair Bidine, Taoufiq Gadi, Mustapha Kchikech:
Independence number and packing coloring of generalized Mycielski graphs. 725-747 - Bostjan Bresar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall:
A new framework to approach Vizing's conjecture. 749-762 - Csilla Bujtás:
Domination number of graphs with minimum degree five. 763-777 - Narda Cordero-Michel, Hortensia Galeana-Sánchez:
Alternating-pancyclism in 2-edge-colored graphs. 779-800 - Július Czap, Igor Fabrici, Stanislav Jendrol':
Colorings of plane graphs without long monochromatic facial paths. 801-808 - Trung Duy Doan, Ingo Schiermeyer:
Proper rainbow connection number of graphs. 809-826 - Michael A. Henning, Jerzy Topp:
Minimal graphs with disjoint dominating and paired-dominating sets. 827-847
Volume 41, Number 4, 2021
- Camino Balbuena, Cristina Dalfó, Berenice Martínez-Barona:
Sufficient conditions for a digraph to admit a (1, \le l)-identifying code. 853-872 - Mohammad Reza Darafsheh, M. Shahsavaran:
On semisymmetric cubic graphs of order 20p2, p prime. 873-891 - Qiaoping Guo, Wei Meng:
Outpaths of arcs in regular 3-partite tournaments. 893-904 - Pingge Chen, Jinhua Liang, Yuejian Peng:
The Lagrangian density of{123, 234, 456} and the Turán number of its extension. 905-921 - David Offner, Kerry Ojakian:
Capture-time extremal cop-win graphs. 923-948 - Faraha Ashraf, Martin Baca, Muhammad Naeem, Andrea Semanicová-Fenovcíková, Muhammad Kamran Siddiqui:
On edge H-irregularity strengths of some graphs. 949-961 - Peter Adams, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit:
The spectrum problem for the connected cubic graphs of order 10. 963-980 - Aijun Dong, Tong Li:
Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten. 981-999 - Nicolas Gastineau, Olivier Togni:
Coloring of the dth power of the face-centered cubic grid. 1001-1020 - Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza:
Z2× Z2-cordial cycle-free hypergraphs. 1021-1040 - Petr Kovár, Michal Kravcenko, Matéj Krbecek, Adam Silber:
Supermagic graphs with many different degrees. 1041-1050 - Shunsuke Nakamura:
Distribution of contractible edges and the structure of noncontracible edges having endvertices with large degree in a 4-connected graph. 1051-1066 - Xue-Gang Chen, Yu-Feng Wang, Xiao-Fei Wu:
Hereditary equality of domination and exponential domination in subcubic graphs. 1067-1075 - Paul D. Manuel:
On the isometric path partition problem. 1077-1089 - Madelynn Chase, Isaac Kadera, Jeffrey A. Mudrock, Ezekiel Thornburgh, Tim Wagstrom:
A note on the equitable choosability of complete bipartite graphs. 1091-1101 - Naoki Matsumoto, Yusuke Suzuki:
Non 1-planarity of lexicographic products of graphs. 1103-1114 - Robert Jajcay, Tom Raiman:
Spectra of orders for k-regular graphs of girth g. 1115-1125 - Norbert Polat:
On antipodal and diametrical partial cubes. 1127-1145 - Hanna Furmanczyk, Rita Zuazua:
Equitable total coloring of corona of cubic graphs. 1147-1163 - Aleksandra Tepeh:
Total domination in generalized prisms and a new domination invariant. 1165-1178 - Jakkepalli Pavan Kumar, P. Venkata Subba Reddy:
Algorithmic aspects of secure connected domination in graphs. 1179-1197 - Modjtaba Ghorbani, Sandi Klavzar, Hamid Reza Maimani, Mostafa Momeni, Farhad Rahimi Mahid, Gregor Rus:
The general position problem on Kneser graphs and on some graph operations. 1199-1213 - Max Marsh, Jeffrey A. Mudrock, Tim Wagstrom:
On list equitable total colorings of the generalized theta graph. 1215-1233
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 2025-04-15 21:26 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:
