Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarDiscussiones 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 - Michael A. Henning, Alister J. Marcon:
Vertices contained in all or in no minimum semitotal dominating set of a tree. 71-93 - Hortensia Galeana-Sánchez, G. Gaytán-Gómez, Rocío Rojas-Monroy:
?-cycles in arc-colored digraphs. 103-115 - 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 - Katrin Casel, Alejandro Estrada-Moreno, Henning Fernau, Juan Alberto Rodríguez-Velázquez:
Weak total resolvability in graphs. 185-210 - 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 - Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták:
3-path in graphs with bounded average degree. 339-353 - Binlong Li, Shenggui Zhang:
Heavy subgraph conditions for longest cycles to be heavy in graphs. 383-392 - 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 - 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
- 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 - Abdollah Alimadadi, Nader Jafari Rad, Doost Ali Mojdeh:
Various bounds for liar's domination number. 629-641 - Magda Dettlaff, Magdalena Lemanska, Gabriel Semanisin, Rita Zuazua:
Some variations of perfect graphs. 661-668 - Kinkar Chandra Das, Kexiang Xu, Yujun Yang:
Nordhaus-Gaddum-type results for resistance distance-based graph invariants. 695-707 - Csilla Bujtás, Zsolt Tuza:
K3-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum. 759-772
Volume 36, Number 4, 2016
- Jianxiang Cao, Lihua Feng, Minyong Shi:
On the edge-hyper-Hamiltonian laceability of balanced hypercubes. 805-817 - 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 - 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 - 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 - 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
maintained by 
, founded at 
, founded at 
last updated on 2019-02-21 20:37 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
