default search action
Discussiones Mathematicae Graph Theory, Volume 37
Volume 37, Number 1, 2017
- Oleg V. Borodin, Anna O. Ivanova
:
All tight descriptions of 3-stars in 3-polytopes with girth 5. 5-12 - Yury Metelsky, Kseniya Schemeleva, Frank Werner
A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs. 13-28 - Evelyne Flandrin, Hao Li, Antoni Marczyk, Jean-François Saclé, Mariusz Wozniak
A note on neighbor expanded sum distinguishing index. 29-37 - Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami
Signed Roman edge k-domination in graphs. 39-53 - Dalibor Froncek
Decomposition of certain complete bipartite graphs into prisms. 55-62 - William F. Klostermeyer, Gary MacGillivray:
Eternal domination: criticality and reachability. 63-77 - Erhard Hexel:
On the H-force number of Hamiltonian graphs and cycle extendability. 79-88 - Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
Structural properties of recursively partitionable graphs with connectivity 2. 89-115 - Patricio Ricardo Garcia-Vázquez, César Hernández-Cruz
Some results on 4-transitive digraphs. 117-129 - Bhagyashree Y. Bam, Charusheela M. Deshpande, Lata N. Kamble:
Almost self-complementary 3-uniform hypergraphs. 131-140 - Xueliang Li, Hengzhe Li
Rainbow connection number of graphs with diameter 3. 141-154 - Ehsan Estaji, Wilfried Imrich
Distinguishing Cartesian products of countable graphs. 155-164 - Poppy Immel, Paul S. Wenger:
The list distinguishing number equals the distinguishing number for interval graphs. 165-174 - Houmem Belkhechine
Criticality of switching classes of reversible 2-structures labeled by an Abelian group. 175-209 - Julien Bensmail:
On q-power cycles in cubic graphs. 211-220 - Nahid Javier, Bernardo Llano:
The dichromatic number of infinite families of circulant tournaments. 221-238 - Sylwia Cichacz
Union of distance magic graphs. 239-249 - Ji-Yuo Guo, Jian-Hua Yin:
A constructive extension of the characterization on potentially Ks, t-bigraphic pairs. 251-259 - Lutz Volkmann:
Signed total Roman domination in digraphs. 261-272 - Dorota Kuziak
Computing the metric dimension of a graph from primary subgraphs. 273-293
Volume 37, Number 2, 2017
- Ewa Drgas-Burchardt
Preface. 299-299 - Jesús Alva-Samos, Juan José Montellano-Ballesteros
Rainbow connectivity of cacti and some infinite digraphs. 301-313 - Marta Borowiecka-Olszewska
Forbidden structures for planar perfect consecutively colourable graphs. 315-336 - Bostjan Bresar, Paul Dorbec
How long can one bluff in the domination game?. 337-352 - Július Czap
WORM colorings of planar graphs. 353-368 - Michael A. Henning, Christian Löwenstein:
Domination game: extremal families for 3/5-conjecture for forests. 369-381 - Ferran Hurtado, Mercè Mora
Distance 2-domination in prisms of graphs. 383-397 - Marián Klesc, Jana Petrillová, Matús Valo:
On the crossing numbers of Cartesian products of wheels and trees. 399-413 - Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer:
On sequential heurestic methods for the maximum independent set problem. 415-426 - Anna Malafiejska, Michal Malafiejski
Interval incidence coloring of subcubic graphs. 427-441 - Joanna Polcyn
One more Turán number and Ramsey number for the loose 3-uniform path of length three. 443-464 - Katarzyna Rybarczyk
The chromatic number of random intersection graphs. 465-476 - Wojciech Widel
A triple of heavy subgraphs ensuring pancyclity of 2-connected graphs. 477-500
Volume 37, Number 3, 2017
- Jing Luo, Runze Wan, Zhongxun Zhu:
On the Laplacian coefficients of tricyclic graphs with prescribed matching number. 505-522 - R. S. Manikandan, P. Paulraja:
C7-decompositions of the tensor product of complete graphs. 523-535 - Meiyu Wang, Shiying Wang, Lei Zhang:
A sufficient condition for graphs to be super k-restricted edge connected. 537-545 - Alejandro Estrada-Moreno
On generalized Sierpi?ski graphs. 547-560 - Yichao Chen, Yan Yang:
The thickness of amalgamations and Cartesian product of graphs. 561-572 - Walter Carballosa
Regularity and planarity of token graphs. 573-586 - Terry A. McKee:
Characterizing atoms that result from decomposition by clique separators. 587-594 - Ravindra B. Bapat, Masoud Karimi
Construction of cospectral integral regular graphs. 595-609 - Kecai Deng, Xiaoling Zhang:
Characterization results for L(2, 1, 1)-labeling problem on trees. 611-622 - Yuefang Sun
On the maximum and minimum sizes of a graph with given k-connectivity. 623-632 - S. Devi Yamini, M. A. Shalu:
One-three join: A graph operation and its consequences. 633-647 - Charles B. Crane:
Forbidden pairs and (k, m)-pancyclicity. 649-663 - Isma Bouchemakh
Packing coloring of some undirected and oriented coronae graphs. 665-690 - Binlong Li, Bo Ning
Heavy subgraphs, stability and Hamiltonicity. 691-710 - Gary Chartrand, Sean English, Ping Zhang:
Kaleidoscopic colorings of graphs. 711-727 - Jing Huang, Shuchao Li:
On the spectral characterizations of graphs. 729-744 - R. Sundara Rajan
A note on the locating-total domination in graphs. 745-754 - Vojtech Rödl, Andrzej Rucinski
Ramsey properties of random graphs and Folkman numbers. 755-776 - Elena V. Konstantinova
Chromatic properties of the Pancake graphs. 777-787 - Liying Kang, Yi Lin, Erfang Shan:
Asymptotic sharpness of bounds on hypertrees. 789-795 - Shoichoi Tsuchiya, Takamasa Yashima:
A degree condition implying Ore-type condition for even [2, b]-factors in graphs. 797-809 - Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Brent J. Thomas:
Saturation spectrum of paths and stars. 811-822 - Peter Dankelmann
The degree-diameter problem for outerplanar graphs. 823-834 - Saieed Akbari
On double-star decomposition of graphs. 835-840
Volume 37, Number 4, 2017
- Lianying Miao, Wenyao Song:
Strong edge-coloring of planar graphs. 845-857 - Majid Hajian, Nader Jafari Rad
On the Roman domination stable graphs. 859-871 - Sarah E. Anderson, Yaoqi Guo, Asa Tenney, Kirsti Wash:
Prime factorization and domination in the hierarchical product of graphs. 873-890 - Sylvain Gravier, Élise Vandomme
Constant 2-labellings and an application to (r, a, b)-covering codes. 891-918 - Anant P. Godbole, Elizabeth Kelley, Emily Kurtz, Pawel Pralat, Yiguang Zhang:
The total acquisition number of the randomly weighted path. 919-934 - Tingzeng Wu, Heping Zhang
Per-spectral characterizations of some bipartite graphs. 935-951 - José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Relating 2-rainbow domination to Roman domination. 953-961 - Susan A. van Aardt:
Every 8-traceable oriented graph is traceable. 963-973 - Yuefang Sun
A sharp lower bound for generalized 3-edge-connectivity of strong product graphs. 975-988 - Maryam Atapour
Twin minus total domination numbers in directed graphs. 989-1004 - Richard H. Hammack, Dewey T. Taylor:
Proper connection of direct products. 1005-1013 - Éric Duchêne, Hamamache Kheddouci, Mohammed Amin Tahraoui, Mariusz Wozniak
Labeled embedding of (n, n-2)-graphs in their complements. 1015-1025 - Lutz Volkmann:
The signed total Roman k-domatic number of a graph. 1027-1038 - Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami:
Signed total Roman edge domination in graphs. 1039-1053 - Jiancheng Wu, Tao Zhang, Sizhong Zhou:
The existence of P≥3-factor covered graphs. 1055-1065 - Faraha Ashraf, Martin Baca
On H-irregularity strength of graphs. 1067-1078 - Hanna Furmanczyk
Equitable colorings of corona multiproducts of graphs. 1079-1094
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-15 19:22 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: