default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 36
Volume 36, Number 1, 2016
- Rafal Kalinowski, Monika Pilsniak, Ingo Schiermeyer, Mariusz Wozniak:
Dense arbitrarily partitionable graphs. 5-22 - P. J. Couch, Bobby Dale Daniel, R. Guidry, W. Paul Wright:
Split Euler tours in 4-regular planar graphs. 23-30 - Stephan Dominique Andres, Andrea Theuser:
Note on the game colouring number of powers of graphs. 31-42 - Martin Sonntag, Hanns-Martin Teichert:
Product of digraphs and their competition graphs. 43-58 - Július Czap
, Jaroslav Ivanco, Peter Sugerek:
M2-edge colorings of cacti and graph joins. 59-69 - Michael A. Henning, Alister J. Marcon:
Vertices contained in all or in no minimum semitotal dominating set of a tree. 71-93 - Igor Fabrici, Frank Göring:
Unique-maximum coloring of plane graphs. 95-102 - Hortensia Galeana-Sánchez, G. Gaytán-Gómez, Rocío Rojas-Monroy:
?-cycles in arc-colored digraphs. 103-115 - Stanislav Jendrol', Michaela Vrbjarová:
Maximum edge-colorings of graphs. 117-125 - Chandrashekar Adiga, B. R. Rakshith:
On spectra of variants of the corona of two graphs and some new equienergetic graphs. 127-140 - Július Czap, Jakub Przybylo, Erika Skrabul'áková:
On an extremal problem in the class of bipartite 1-planar graphs. 141-151 - Michael A. Henning, Viroshan Naicker:
Bounds on the disjunctive total domination number of a tree. 153-171 - Wojciech Widel:
A Fan-type heavy pair od subgraphs for pancyclicity of 2-connected graphs. 173-184 - Katrin Casel, Alejandro Estrada-Moreno, Henning Fernau, Juan Alberto Rodríguez-Velázquez:
Weak total resolvability in graphs. 185-210 - Jaroslav Ivanco:
Supermagic generalized double graphs. 211-225 - Peter Hudák, Mária Maceková, Tomás Madaras, Pavol Siroczki:
Light graphs in planar graphs of large girth. 227-238
Volume 36, Number 2, 2016
- Mieczyslaw Borowiecki, Izak Broere:
Hamiltonicity and generalised total colourings of planar graphs. 243-257 - Péter G. N. Szabó:
Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees. 259-278 - Nibedita Mandal, Pratima Panigrahi:
Solutions of some L(2, 1)-coloring related open problems. 279-297 - Sylwia Cichacz, Dalibor Froncek, Elliot Krop, Christopher Raridan:
Distance magic Cartesian product of graphs. 299-308 - Hortensia Galeana-Sánchez, Rocío Sánchez-López:
Kernels by monochromatic paths and color-perfect digraphs. 309-321 - Heping Zhang, Xiangqian Zhou:
A maximum resonant set of polyomino graphs. 323-337 - Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták:
3-path in graphs with bounded average degree. 339-353 - Lily Chen, Bofeng Huo, Yingbin Ma:
Hardness results for total rainbow connection of graphs. 355-362 - Binlong Li, Liming Xiong, Jun Yin:
Large degree vertices in longest cycles of graphs, I. 363-382 - Binlong Li, Shenggui Zhang:
Heavy subgraph conditions for longest cycles to be heavy in graphs. 383-392 - Marisa Gutierrez, Silvia B. Tondato:
End simplicial vertices in path graphs. 393-408 - Zhiren Sun, Fan Yang, Sizhong Zhou:
A neighborhood condition for fractional ID-[a, b]-factor-critical graphs. 409-418 - Bhagyashree Y. Bam, Charusheela M. Deshpande, Lata N. Kamble:
The existence of quasi regular and bi-regular self-complementary 3-uniform hypergraphs. 419-426 - Michael A. Henning, Christian Löwenstein:
A characterization of hypergraphs with large domination number. 427-438 - Elliot Laforge, Chira Lumduanhom, Ping Zhang:
Characterizations of graphs having large proper connection numbers. 439-453 - Ivan Gutman, Xueliang Li, Yaping Mao:
The Steiner Wiener index of a graph. 455-465 - Seyyed Mehdi Hosseini Moghaddam, Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann:
New bounds on the signed total domination number of graphs. 467-477 - Izak Broere, Johannes Heidema, Moroli D. V. Matsoha:
The quest for a characterization of hom-properties of finite character. 479-500
Volume 36, Number 3, 2016
- Tingzeng Wu, Weigen Yan, Heping Zhang:
Extremal matching energy of complements of trees. 505-521 - Mohammad Javaheri:
Cycle double covers of infinite planar graphs. 523-544 - Atsuhiro Nakamoto, Seiya Negami, Kyoji Ohba, Yusuke Suzuki:
Looseness and independence number of triangulations on closed surfaces. 545-554 - Xiaoyun Lu, Douglas B. West:
A new proof that 4-connected planar graphs are Hamiltonian-connected. 555-564 - Igor Fabrici, Jochen Harant, Stanislav Jendrol':
On longest cycles in essentially 4-connected planar graphs. 565-575 - Benjamin S. Baumer, Gary S. Bloom, Yijin Wei:
The smallest non-autograph. 577-602 - Oleg V. Borodin, Anna O. Ivanova:
On the weight of minor faces in triangle-free polytopes. 603-619 - Akira Saito, Liming Xiong:
The Ryjáček closure and a forbidden subgraph. 621-628 - Abdollah Alimadadi, Nader Jafari Rad, Doost Ali Mojdeh:
Various bounds for liar's domination number. 629-641 - Christina M. Mynhardt, Christopher M. van Bommel:
Triangle decompositions of planar graphs. 643-659 - Magda Dettlaff, Magdalena Lemanska, Gabriel Semanisin, Rita Zuazua:
Some variations of perfect graphs. 661-668 - Yaping Mao:
The vertex-rainbow index of a graph. 669-681 - Halina Bielak, Sebastain Kieliszek:
The Turán number of the graph 2P5. 683-694 - Kinkar Chandra Das, Kexiang Xu, Yujun Yang:
Nordhaus-Gaddum-type results for resistance distance-based graph invariants. 695-707 - Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt:
Sum list edge colorings of graphs. 709-722 - Lorenzo Traldi:
Splitting cubic circle graphs. 723-741 - Gábor Mészáros:
On path-pairability in the Cartesian product of graphs. 743-758 - Csilla Bujtás, Zsolt Tuza:
K3-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum. 759-772 - Zheng Yan:
Spanning trees whose stems have a bounded number of branch vertices. 773-778
Volume 36, Number 4, 2016
- Thamodharan Govindan, Appu Muthusamy:
Perfect set of Euler tours of Kp, p, p. 783-796 - Xuanlong Ma, Kaishun Wang:
Integral Cayley sum graphs and groups. 797-803 - Jianxiang Cao, Lihua Feng, Minyong Shi:
On the edge-hyper-Hamiltonian laceability of balanced hypercubes. 805-817 - Christian Garske, Martin Sonntag, Hanns-Martin Teichert:
Niche hypergraphs. 819-832 - Yuefang Sun:
Sharp upper bounds for generalized edge-connectivity of product graphs. 833-843 - Yi-Zheng Fan, An-Hong Liu, Xi-Xi Peng, Ying-Ying Tan:
Maximizing spectral radii of uniform hypergraphs with few edges. 845-856 - Wilfried Imrich, Ali Iranmanesh, Sandi Klavzar, Abolghasem Soltani:
Edge-transitive lexicographic and Cartesian products. 857-865 - Jaya Percival Mazorodze, Simon Mukwembi, Tomás Vetrík:
The Gutman index and the edge-Wiener index of graphs with given vertex-connectivity. 867-876 - Nader Jafari Rad:
On the complexity of reinforcement in graphs. 877-887 - V. A. Aksenov, Oleg V. Borodin, Anna O. Ivanova:
An extension of Kotzig's Theorem. 889-897 - Suresh Dara, Venkateshwarlu Deva, Suresh Manjanath Hegde, S. B. Rao, Thomas Zaslavsky:
The dynamic of the forest graph operator. 899-913 - Hajo Broersma, Binlong Li, Shenggui Zhang:
Forbidden subgraphs for hamiltonicity of 1-tough graphs. 915-929 - Xueliang Li, Yaping Mao:
Graphs with large generalized (edge-)connectivity. 931-958 - P. Francis, S. Francis Raj:
Bounds for b-chromatic number of subgraphs and edge-deleted subgraphs. 959-976 - Ligong Wang, Weige Xi:
Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs. 977-988 - Wayne Goddard, Honghai Xu:
Vertex colorings without rainbow subgraphs. 989-1005 - Amanda Niedzialomski:
Radio graceful Hamming graphs. 1007-1020 - Liliana Alcón:
A note on path domination. 1021-1034 - Ashwin Ganesan:
Edge-transitivity of Cayley graphs generated by transpositions. 1035-1042 - Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
A note on non-dominating set partitions in graphs. 1043-1050 - Dorota Kuziak, Juan Alberto Rodríguez-Velázquez, Ismael González Yero:
Closed formulae for the strong metric dimension of lexicographic product graphs. 1051-1064
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-12-04 01:29 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:
