Volume 32, Number 1, 2012

• 
  Ismail Sahul Hamid: Independent transversal domination in graphs. 5-17
• 
  A. P. Santhakumaran: Median of a graph with respect to edges. 19-29
• 
  Tomás Vetrík: List coloring of complete multipartite graphs. 31-37
• 
  Kumarappan Kathiresan, K. Muthu Guru Packiam: On total vertex irregularity strength of graphs. 39-45
• 
  Shiying Wang, Shurong Zhang: Embeddings of hamiltonian paths in faulty k-ary 2-cubes. 47-61
• 
  Futaba Fujie-Okamoto, Kyle Kolasinski, Jianwei Lin, Ping Zhang: Vertex rainbow colorings of graphs. 63-80
• 
  Michael Dorfling, Samantha Dorfling: Recognizable colorings of cycles and trees. 81-90
• 
  Pak Tung Ho: The projective plane crossing number of the circulant graph C(3k;{1, k}). 91-108
• 
  T. Jebaraj, A. P. Santhakumaran: Double geodetic number of a graph. 109-119
• 
  S. Arockiaraj, Kumarappan Kathiresan: p-Wiener intervals and p-Wiener free intervals. 121-127
• 
  Seyed Mahmoud Sheikholeslami, Lutz Volkmann: The k-rainbow domatic number of a graph. 129-140
• 
  Oleg V. Borodin, Anna O. Ivanova: 2-distance 4-colorability of planar subcubic graphs with girth at least 22. 141-151
• 
  Mohammad Hailat: On generalization of the friendship theorem. 153-160
• 
  S. Benecke, Christina M. Mynhardt: Characterizing Cartesian fixers and multipliers. 161-175
• 
  Petr Gregor, Riste Skrekovski: Parity vertex colorings of binomial trees. 177-180
• 
  Przemyslaw Gordinowicz, Pawel Pralat: The first player wins the one-colour triangle avoidance game on 16 vertices. 181-185

Volume 32, Number 2, 2012

• 
  A. P. Santhakumaran, P. Titus: The vertex monophonic number of a graph. 191-204
• 
  César Hernández-Cruz: 3-transitive digraphs. 205-219
• 
  Hong Wang: Disjoint 5-cycles in a graph. 221-242
• 
  L'udmila Bezegová, Jaroslav Ivanco: A characterization of complete tripartite degree-magic graphs. 243-253
• 
  Hong-Hai Li, Li Su, Liu-Rong Zheng: The Laplacian spectrum of some digraphs obtained from the wheel. 255-261
• 
  Mustapha Chellali, Nacéra Meddah: Trees with equal 2-domination and 2-independence numbers. 263-270
• 
  M. S. A. Bataineh, Mohammed M. M. Jaradat: Edge maximal C_2k+1-edge disjoint free graphs. 271-278
• 
  Le Anh Vinh: On kaleidoscopic pseudo-randomness of finite Euclidean graphs. 279-287
• 
  Andrej Taranenko, Aleksander Vesel: 1-factors and characterization of reducible faces of plane elementary bipartite graphs. 289-297
• 
  Linda Eroh, Ralucca Gera, Cong X. Kang, Craig E. Larson, Eunjeong Yi: Domination in functigraphs. 299-319
• 
  A. P. Santhakumaran, S. V. Ullas Chandran: The vertex detour hull number of a graph. 321-330
• 
  Mariusz Haluszczak: On Ramsey (K_{1, 2}, K_n)-minimal graphs. 331-339
• 
  T. Asir, T. Tamizh Chelvam: Intersection graph of gamma sets in the total graph. 341-356
• 
  Mariusz Meszka, Zdzislaw Skupien: Decompositions of a complete multidigraph into almost arbitrary paths. 357-372
• 
  Terry A. McKee: Edge cycle extendable graphs. 373-378
• 
  Gyula O. H. Katona, Ákos Kisvölcsey: Erdös-Ko-Rado from intersecting shadows. 379-382

Volume 32, Number 3, 2012

• 
  Raffaele Mosca: Stable sets for (P₆, K_{2, 3})-free graphs. 387-401
• 
  Martin Sonntag, Hanns-Martin Teichert: Iterated neighborhood graphs. 403-417
• 
  Adel P. Kazemi: On the total k-domination number of graphs. 419-426
• 
  Ali Ahmad, Edy Tri Baskoro, M. Imran: Total vertex irregularity strength of disjoint union of Helm graphs. 427-434
• 
  Oliver Schaudt: Total domination versus paired domination. 435-447
• 
  Subramanian Arumugam, Kalimuthu Karuppasamy, Varughese Mathew: Fractional distance domination in graphs. 449-459
• 
  Seyed Mahmoud Sheikholeslami, Lutz Volkmann: The total {k}-domatic number of digraphs. 461-471
• 
  Oliver Schaudt: Paired- and induced paired-domination in (E, net)-free graphs. 473-485
• 
  Ryan C. Jones, Ping Zhang: Nowhere-zero modular edge-graceful graphs. 487-505
• 
  K. A. Germina, Koombail Shahul Hameed: On composition of signed graphs. 507-516
• 
  Eric Sopena: Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs. 517-533
• 
  P. Roushini Leely Pushpam, A. Saibulla: On super (a, d)-edge antimagic total labeling of certain families of graphs. 535-543
• 
  Dávid Hudák, Peter Sugerek: Light edges in 1-planar graphs with prescribed minimum degree. 545-556
• 
  Oliver Pechenik, Jenifer Wise: Generalized graph cordiality. 557-567
• 
  Dániel Gerbner, Balázs Keszegh, Cory Palmer: Generalizations of the tree packing conjecture. 569-582
• 
  John J. Lattanzio, Quan Zheng: Generalized matrix graphs and completely independent critical cliques in any dimension. 583-602

Volume 32, Number 4, 2012

• 
  Terry A. McKee: The i-chords of cycles and paths. 607-615
• 
  Andrey A. Dobrynin, Leonid S. Melnikov: 4-chromatic Koester graphs. 617-627
• 
  Hong-yu. Chen, Xue-Gang Chen, Wai Chee Shiu, Pak Kiu Sun: On the total restrained domination number of direct products of graphs. 629-641
• 
  Mustapha Chellali, Soufiane Khelifi: Double domination critical and stable graphs upon vertex removal. 643-657
• 
  Allan Bickle: Structural results on maximal k-degenerate graphs. 659-676
• 
  Mustapha Chellali, Hocine Boumediene Merouane: On the dominator colorings in trees. 677-683
• 
  José Cáceres, Ortrud R. Oellermann, María Luz Puertas: Minimal trees and monophonic convexity. 685-704
• 
  Garry L. Johns, Ryan C. Jones, Kyle Kolasinski, Ping Zhang: Hamiltonian-colored powers of strong digraphs. 705-724
• 
  Gilbert Eyabi, Jobby Jacob, Renu C. Laskar, Darren A. Narayan, Dan Pillone: Minimal rankings of the Cartesian product K_n\Box K_m. 725-735
• 
  Dávid Hudák, Tomás Madaras, Yusuke Suzuki: On properties of maximal 1-planar graphs. 737-747
• 
  K. Pattabiraman, P. Paulraja: Wiener and vertex PI indices of the strong product of graphs. 749-769
• 
  Ardeshir Dolati, Somayyeh Golalizadeh: Sharp bounds for the number of matchings in generalized-theta-graphs. 771-782
• 
  Sandi Klavzar, Gasper Mekis: On the rainbow connection of Cartesian products and their subgraphs. 783-793
• 
  Wayne Goddard, Honghai Xu: The S-packing chromatic number of a graph. 795-806
• 
  Magdalena Lemanska, Rita Zuazua: Convex universal fixers. 807-812

last updated on Wed May 22 03:24:03 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page