default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 35
Volume 35, Number 1, 2015
- Ismail Sahul Hamid, S. Saravanakumar
:
Packing parameters in graphs. 5-16 - Kannan Pattabiraman, P. Paulraja:
Harary index of product graphs. 17-33 - Louis M. Friedler, Rommy Márquez, Jake A. Soloff:
Products of geodesic graphs and the geodetic number of products. 35-42 - Anna Benini, Anita Pasotti:
α-labelings of a class of generalized Petersen graphs. 43-53 - Jennifer Loe, Danielle Middelbrooks, Ashley Morris, Kirsti Wash:
2-tone colorings in graphs products. 55-72 - Saad I. El-Zanati, Marie Ermete, James Hasty, Michael Plantholt, Shailesh K. Tipnis:
On decomposing regular graphs into isomorphic double-stars. 73-79 - Lily Chen, Xueliang Li, Kang Yang, Yan Zhao:
The 3-rainbow index of a graph. 81-94 - Naiyer Pirouz:
Graphic splitting of cographic matroids. 95-104 - Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao:
Graphs with 3-rainbow index n-1 and n-2. 105-120 - Peter Recht, Eva-Maria Sprengel:
Maximum cycle packing in Eulerian graphs using local traces. 121-132 - Carmen C. Centeno, Dieter Rautenbach:
Remarks on dynamic monopolies with given average thresholds. 133-140 - Olivier Baudon, Julien Bensmail, Éric Sopena:
An oriented version of the 1-2-3 Conjecture. 141-156 - Krzysztof Turowski:
Optimal backbone coloring of split graphs with matching backbones. 157-169 - Yair Caro, Josef Lauri, Christina Zarb:
Constrained colouring and σ-hypergraphs. 171-189 - Hajime Matsumura:
On spanning k-tree in which specified vertices have degree less than k. 191-196 - John Bosica, Claude Tardif:
Fractional aspects of the Erdös-Faber-Lovász Conjecture. 197-202
Volume 35, Number 2, 2015
- Bert Seamone:
On uniquely Hamiltonian claw-free and triangle-free graphs. 207-214 - Ayushi Dhama, Deepa Sinha:
On •-line signed graphs L•(S). 215-227 - Ruixia Wang:
(k-1)-kernels in strong k-transitive digraphs. 229-235 - Henry Escuadro, Futaba Fujie, Chad E. Musick:
A note on the total detection numbers of cycles. 237-247 - Yi-Zheng Fan, Xiao-Xin Li, Yi Wang, Feifei Zhang:
The least eigenvalue of graphs whose complements are unicyclic. 249-260 - Jafar Amjadi, Negar Mohammadi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The k-rainbow bondage number of a digraph. 261-270 - Zhenming Bi, Ping Zhang:
On k-path pancyclic graphs. 271-281 - William F. Klostermeyer, Christina M. Mynhardt:
Domination, eternal domination and clique covering. 283-300 - Hasan Al-Ezeh, Omar A. AbuGhneim, Eman A. AbuHijleh:
Characterizing which powers of hypercubes and folded hypercubes are divisor graphs. 301-311 - Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. 313-314 - Diana Avella-Alaminos, Magda Dettlaff, Magdalena Lemanska, Rita Zuazua:
Total domination multisubdivision number of a graph. 315-327 - Jens-P. Bode, Anika Fricke, Arnfried Kemnitz:
Improved sufficient conditions for Hamiltonian properties. 329-334 - Markus Dod, Tomer Kotek, James Preen, Peter Tittmann:
Bipartition polynomials, the Ising model and domination in graphs. 335-353 - Jochen Harant, Julia Niebling, Sebastian Richter:
Eigenvalue conditions for induced subgraphs. 355-363 - Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer:
Extending the Max Algorithm for maximum independent set. 365-386 - Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao:
Graphs with 4-rainbow index 3 and n-1. 387-398
Volume 35, Number 3, 2015
- Ferdinand P. Jamil, Hearty M. Nuenay:
On minimal geodetic domination in graphs. 403-418 - Felix Joos:
A note on longest paths in circular arc graph. 419-426 - Toru Araki, Masayoshi Matsushita, Yota Otachi:
Completely independent spanning trees in (partial) k-trees. 427-437 - Karuvachery Pravas, Ambat Vijayakumar:
The median problem on k-partite graphs. 439-446 - Ville Junnila:
Optimal locating-total dominating sets in strips of height 3. 447-462 - Gabriela Karafová, Roman Soták:
Generalized fractional total colorings of graphs. 463-473 - Zheng Yan:
Strong f-star factors of graphs. 475-482 - Jorge L. Arocha, Javier Bracho, Natalia García-Colín, Isabel Hubard:
Reconstructing surface triangulations by their intersection matrices. 483-491 - Francesco M. Malvestuto, Marina Moscarini:
Decomposability of abstract and path-induced convexities in hypergraphs. 493-515 - Arnfried Kemnitz, Massimiliano Marangio, Peter Mihók, Janka Oravcová, Roman Soták:
Generalized fractional and circular total colorings of graphs. 517-532 - Fatima Affif Chaouche, Carrie G. Rutherford, Robin Whitty:
Pancyclicity when each cycle must pass exactly k Hamilton cycle chords. 533-539 - Ewa M. Kubicka, Grzegorz Kubicki, Kathleen A. McKeon:
Chromatic sums for colorings avoiding monochromatic subgraphs. 541-555 - Yair Caro, Josef Lauri, Christina Zarb:
The saturation number for the length of degree monotone paths. 557-569 - Wayne Goddard, Kirsti Wash, Honghai Xu:
WORM colorings. 571-584 - S. F. Forouhandeh, Nader Jafari Rad, R. Pandiyaraj, H. P. Patil, B. Vaqari Motlagh:
A note on total graphs. 585-587 - Daniel C. Slilaty, Thomas Zaslavsky:
Characterization of line-consistent signed graphs. 589-594 - Yoshio Sano:
On the hypercompetition numbers of hypergraphs with maximum degree at most two. 595-598
Volume 35, Number 4, 2015
- Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato:
Asteroidal quadruples in non rooted path graphs. 603-614 - Jason Hedetniemi:
On unique minimum dominating sets in some Cartesian product graphs. 615-628 - Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci:
Decomposition of complete multigraphs into stars and cycles. 629-639 - Lutz Volkmann:
Upper bounds on the signed total (k, k)-domatic number of graphs. 641-650 - Abdollah Khodkar, Babak Samadi, Lutz Volkmann:
On the signed (total) k-independence number in graphs. 651-662 - Abdul Qudair Baig, Muhammad Javaid, Abdul Raheem:
On super edge-antimagicness of subdivided stars. 663-673 - Tjasa Paj, Simon Spacapan:
Maximum independent sets in direct products of cycles or trees with arbitrary graphs. 675-688 - Jonelle Hook:
Critical graphs for R(Pn, Pm) and the star-critical Ramsey number for paths. 689-701 - Nawarat Ananchuen, Watcharaphong Ananchuen:
Some toughness results in independent domination critical graphs. 703-713 - Shanmugasundaram Jeevadoss, Appu Muthusamy:
Decomposition of complete bipartite multigraphs into paths and cycles having k edges. 715-731 - Italo J. Dejter:
Rainbow tetrahedra in Cayley graphs. 733-754 - KM. Kathiresan, S. David Laurence:
On super (a, d)-antimagic total covering of star related graphs. 755-764 - Terry A. McKee:
A new characterization of unichord-free graphs. 765-771 - Clive Elphick, Pawel Wocjan:
Unified spectral bounds on the chromatic number. 773-780 - Csilla Bujtás, Sandi Klavzar, Gasper Kosmrlj:
Domination game critical graphs. 781-796 - Suk Jai Seo, Peter J. Slater:
Fault tolerant detectors for distinquishing sets in graphs. 797-818
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-10-29 01:39 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:
