default search action
Graphs and Combinatorics, Volume 24
Volume 24, Number 1, February 2008
- Csilla Bujtás, Zsolt Tuza:
Uniform Mixed Hypergraphs: The Possible Numbers of Colors. 1-12 - Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto:
On a Spanning Tree with Specified Leaves. 13-18 - Mirko Hornák, Zuzana Kocková:
On Planar Graphs Arbitrarily Decomposable into Closed Trails. 19-28 - Hossein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar:
Some Notes on Signed Edge Domination in Graphs. 29-35 - Christian Löwenstein, Dieter Rautenbach:
Domination in Graphs of Minimum Degree at least Two and Large Girth. 37-46 - L. McCauley, C. A. Rodger:
Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs. 47-52 - Surahmat, Edy Tri Baskoro, Ioan Tomescu:
The Ramsey Numbers of Large cycles Versus Odd Wheels. 53-58 - Raphael Yuster:
Almost Given Length Cycles in Digraphs. 59-65
Volume 24, Number 2, April 2008
- Tomasz Bartnicki, Jaroslaw Grytczuk:
A Note on the Game Chromatic Index of Graphs. 67-70 - Jiuying Dong:
A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph. 71-80 - Mitsugu Hirasaka, Hanguk Kang, Kijung Kim:
Equitable Partitions of Flat Association Schemes. 81-89 - Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan:
Total Colorings of Planar Graphs without Small Cycles. 91-100 - Manoel Lemos:
Relations between the Circumference and e -Circumference of a Matroid. 101-105 - Xiaojuan Li, Zhao Zhang:
Path-Factors in the Square of a Tree. 107-111 - Yuejian Peng:
A note on the Structure of Turán Densities of Hypergraphs. 113-125 - Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Addendum to "Bicolored Matchings in Some Classes of Graphs". 127-128
Volume 24, Number 3, June 2008
- Elizabeth J. Billington, Nicholas J. Cavenagh:
Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths. 129-147 - Yeow Meng Chee, Alan C. H. Ling, Hao Shen:
The Fine Intersection Problem for Steiner Triple Systems. 149-157 - Beifang Chen, Guantao Chen:
Gauss-Bonnet Formula, Finiteness Condition, and Characterizations of Graphs Embedded in Surfaces. 159-183 - Mariko Hagita, Makoto Matsumoto, Fumio Natsu, Yuki Ohtsuka:
Error Correcting Sequence and Projective De Bruijn Graph. 185-194 - Hong-Jian Lai, Rui Xu, Ju Zhou:
On Group Connectivity of Graphs. 195-203 - Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht:
On the Ramsey Number of Sparse 3-Graphs. 205-228 - Hiroaki Taniguchi:
On Automorphisms of Some d -Dimensional Dual Hyperovals in PG ( d ( d + 3)/2, 2). 229-236
Volume 24, Number 4, September 2008
- Mikio Kano, Xueliang Li:
Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey. 237-263 - József Balogh, Alexandr V. Kostochka:
On 2-Detour Subgraphs of the Hypercube. 265-272 - R. B. Bapat, A. K. Lal, Sukanta Pati:
Laplacian Spectrum of Weakly Quasi-threshold Graphs. 273-290 - L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju:
Hadwiger Number and the Cartesian Product of Graphs. 291-301 - Paul Dorbec, Sylvain Gravier:
Paired-Domination in P 5-Free Graphs. 303-308 - Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Disproof of a Conjecture on the Subdivision Domination Number of a Graph. 309-312 - Mario Gionfriddo, Peter Horák, Lorenzo Milazzo, Alexander Rosa:
Equitable Specialized Block-Colourings for Steiner Triple Systems. 313-326 - Izolda Gorgol:
Rainbow Numbers for Cycles with Pendant Edges. 327-331 - Michael A. Henning, Anders Yeo:
Total Domination in Graphs with Given Girth. 333-348 - Robert E. Jamison, Gretchen L. Matthews:
On the Acyclic Chromatic Number of Hamming Graphs. 349-360 - Nathan Lemons, Cory Palmer:
The Unbalance of Set Systems. 361-365 - April Parker, C. A. Rodger:
Embedding Partial 4-cycle Systems of Arbitrary Index. 367-371 - Amitai Perlstein, Rom Pinchasi:
Generalized Thrackles and Geometric Graphs in \mathbbR3{\mathbb{R}}^3 with No Pair of Strongly Avoiding Edges. 373-389 - Oleg Pikhurko:
Perfect Matchings and K 43 -Tilings in Hypergraphs of Large Codegree. 391-404
Volume 24, Number 5, October 2008
- Armen S. Asratian, Carl Johan Casselgren:
On Path Factors of (3, 4)-Biregular Bigraphs. 405-411 - Sheshayya A. Choudum, T. Karthick, M. A. Shalu:
Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs. 413-428 - Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi:
Silver Cubes. 429-442 - Jiangyan Guo, Elkin Vumar:
On the Circumference of 2-Connected P3\mathcal{P}_{3}-Dominated Graphs. 443-451 - Xinmin Hou, Michelle Edwards:
Paired Domination Vertex Critical Graphs. 453-459 - Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph. 461-468 - Kenta Ozeki, Tomoki Yamashita:
A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph. 469-483 - Jácint Szabó:
Packing Trees with Constraints on the Leaf Degree. 485-494
Volume 24, Number 6, November 2008
- Ch. Sobhan Babu, Ajit A. Diwan:
Degree Condition for Subdivisions of Unicyclic Graphs. 495-509 - Arie Bialostocki, Rasheed Sabar, Daniel Schaal:
On a Zero-Sum Generalization of a Variation of Schur's Equation. 511-518 - Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zhang:
A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations. 519-530 - András Gyárfás, Gábor N. Sárközy:
Size of Monochromatic Double Stars in Edge Colorings. 531-536 - Akira Hiraki:
Strongly Closed Subgraphs in a Distance-Regular Graph with c 2 > 1. 537-550 - Xueliang Li, Yan Liu:
On the Determination Problem for P 4-Transformation of Graphs. 551-562 - Yan Liu, Guiying Yan:
Factor-Critical Graphs with Given Number of Maximum Matchings. 563-569 - Hiroshi Suzuki:
Almost 2-Homogeneous Graphs and Completely Regular Quadrangles. 571-585 - Shiying Wang, Jun Yuan, Aixia Liu:
Sufficient Conditions for Super-Arc-Strongly Connected Oriented Graphs. 587-595 - Zihan Yuan, Ling Tang, Yuanqiu Huang, Jinwang Liu:
The Crossing Number of C (8, 2) P n . 597-604
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.