Graphs and Combinatorics, Volume 28

Volume 28, Number 1, January 2012

Mustapha Chellali, Odile Favaron, Adriana Hansberg, Lutz Volkmann:
k-Domination and k-Independence in Graphs: A Survey. 1-55
H. J. Broersma, Zdenek Ryjácek, Petr Vrána:
How Many Conjectures Can You Stand? A Survey. 57-75
Bijo S. Anand, Manoj Changat, Sandi Klavzar, Iztok Peterin:
Convex Sets in Lexicographic Products of Graphs. 77-84
Grant Cairns, Yury Nikolayevsky:
Outerplanar Thrackles. 85-96
Mustapha Chellali, Frédéric Maffray:
Dominator Colorings in Some Classes of Graphs. 97-107
Sebastian M. Cioaba, André Kündgen:
Covering Complete Hypergraphs with Cuts of Minimum Total Size. 109-122
Hosein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar, Douglas B. West:
Connected Domination Number of a Graph and its Complement. 123-131
Jianchu Zeng, Yanpei Liu, Rongxia Hao:
Counting Orientable Embeddings by Genus for a Type of 3-Regular Graph. 133-142

Litao Guo, Ruifang Liu, Xiaofeng Guo:
Super Connectivity and Super Edge Connectivity of the Mycielskian of a Graph. 143-147
Douglas Bauer, H. J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel:
Degree Sequences and the Existence of k-Factors. 149-166
Véronique Bruyère, Gwenaël Joret, Hadrien Mélot:
Trees with Given Stability Number and Minimum Number of Stable Sets. 167-187
Joshua N. Cooper, John Lenz, Timothy D. LeSaulnier, Paul S. Wenger, Douglas B. West:
Uniquely C 4-Saturated Graphs. 189-197
Michael A. Henning, Anders Yeo:
Girth and Total Domination in Graphs. 199-214
Jianfeng Hou, Guizhen Liu, Jianliang Wu:
Acyclic Edge Coloring of Planar Graphs Without Small Cycles. 215-226
Yufei Huang, Bolian Liu, Siyuan Chen:
The Generalized τ-Bases of Primitive Non-Powerful Signed Digraphs with d Loops. 227-242
Vadim E. Levit, Eugen Mandrescu:
Critical Independent Sets and König-Egerváry Graphs. 243-250
Xueliang Li, Yuefang Sun:
Upper Bounds for the Rainbow Connection Numbers of Line Graphs. 251-263
Anna de Mier, Marc Noy:
On the Maximum Number of Cycles in Outerplanar and Series-Parallel Graphs. 265-275
Shengning Qiao, Shenggui Zhang:
Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs. 277-285
Yingzhi Tian, Jixiang Meng, Xiaodong Liang:
On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs. 287-296

R. Julian R. Abel, Frank E. Bennett:
Super-Simple Twofold Steiner Pentagon Systems. 297-308
Ni Cao, Han Ren:
Exponentially Many Monochromatic n-Matchings in K 3n-1. 309-314
Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper, Bill Waller:
A Characterization of Graphs Where the Independence Number Equals the Radius. 315-332
Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Convexity Number of Graphs. 333-345
Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan:
Finding a Sun in Building-Free Graphs. 347-364
Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood:
Token Graphs. 365-380
S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Small Edge Sets Meeting all Triangles of a Graph. 381-392
Lili Zhang, Yehong Shao, Guihai Chen, Xinping Xu, Ju Zhou:
s-Vertex Pancyclic Index. 393-406
Christian Löwenstein, Dieter Rautenbach:
Pairs of Disjoint Dominating Sets in Connected Cubic Graphs. 407-421
Tran Dan Thu:
On Half-Way AZ-Style Identities. 423-432
Zan-Bo Zhang, Xiaoyan Zhang, Dingjun Lou, Xuelian Wen:
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs. 433-448

Akira Hiraki:
A Characterization of the Hamming Graphs and the Dual Polar Graphs by Completely Regular Subgraphs. 449-467
Ville Junnila, Tero Laihonen:
Optimal Identifying Codes in Cycles and Paths. 469-481
Koko K. Kayibi, S. Pirzada:
Planarity, Symmetry and Counting Tilings. 483-497
Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki:
Coloring Eulerian Triangulations of the Klein Bottle. 499-530
Shuchao Li, Li Zhang:
Permanental Bounds for the Signless Laplacian Matrix of a Unicyclic Graph with Diameter d. 531-546
Justin Southey, Michael A. Henning:
An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs. 547-554
Yi Wang, Yi-Zheng Fan:
The Least Eigenvalue of Graphs with Cut Edges. 555-561
Baogang Xu, Xingxing Yu:
Maximum Directed Cuts in Graphs with Degree Constraints. 563-574
Ismael González Yero, Juan Alberto Rodríguez-Velazquez:
Partitioning a Graph into Global Powerful k-Alliances. 575-583
Jian-Hua Yin:
The Characterization for a Graphic Sequence to have a Realization Containing K 1, 1, s. 585-595

Yichao Chen, Toufik Mansour, Qian Zou:
Embedding Distributions and Chebyshev Polynomials. 597-614
Shonda Gosselin:
Self-Complementary Non-Uniform Hypergraphs. 615-635
Stephen G. Hartke, Geir T. Helleloid:
Reconstructing a Graph from its Arc Incidence Graph. 637-652
Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé:
Packing and Covering Triangles in K 4-free Planar Graphs. 653-662
Changxiang He, Yusheng Li, Lin Dong:
Three-Color Ramsey Numbers of K n Dropping an Edge. 663-669
Andreas M. Hinz, Daniele Parisse:
The Average Eccentricity of Sierpiński Graphs. 671-686
Alexandr V. Kostochka, Gexin Yu:
Graphs Containing Every 2-Factor. 687-716
Diego Scheide, Michael Stiebitz:
The Maximum Chromatic Index of Multigraphs with Given Δ and μ. 717-722
Zefang Wu, Xu Yang, Qinglin Yu:
On Cartesian Product of Factor-Critical Graphs. 723-736
Jinquan Xu, Ping Li, Hong-Jian Lai:
The Connectivity and Diameter of Second Order Circuit Graphs of Matroids. 737-742
Fan Yang, Xiangwen Li:
Group Connectivity in 3-Edge-Connected Graphs. 743-750

Beifang Chen, Richard P. Stanley:
Orientations, Lattice Polytopes, and Group Arrangements II: Modular and Integral Flow Polynomials of Graphs. 751-779
Ashraf Daneshkhah, Alice Devillers:
A Classification of Graphs Whose Subdivision Graph is Locally Distance Transitive. 781-789
Bart De Bruyn:
Intriguing Sets of Points of Q(2n, 2) \Q +(2n - 1, 2). 791-805
Mirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Dense Arbitrarily Vertex Decomposable Graphs. 807-821
Boris Horvat, Tomaz Pisanski, Arjana Zitnik:
Isomorphism Checking of I-graphs. 823-830
Seog-Jin Kim, Suh-Ryung Kim, Jung Yeun Lee, Won-Jin Park, Yoshio Sano:
Graph Equation for Line Graphs and m-Step Graphs. 831-842
Mark Mixer, Egon Schulte:
Symmetric Graphs from Polytopes of High Rank. 843-857
Kenta Ozeki, Tomoki Yamashita:
Length of Longest Cycles in a Graph Whose Relative Length is at Least Two. 859-868
F. Ramezani, Behruz Tayfeh-Rezaie:
Spectral Characterization of Some Cubic Graphs. 869-876
R. Sangeetha, A. Muthusamy:
Hamilton Cycle Rich 2-Factorization of Complete Equipartite Graphs-II. 877-887
Guanghui Wang, Bin Liu, Jiguo Yu, Guizhen Liu:
Circular Coloring of Planar Digraphs. 889-900
Guanghui Wang, Hao Li, Yan Zhu, Guizhen Liu:
A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs. 901-905

Last update Mon May 20 00:58:20 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page