default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 25
Volume 25, Number 1, May 2009
- Anna Benini, Anita Pasotti
:
On the Existence of Elementary Abelian Cycle Systems. 1-14 - Robert Brier, Darryn E. Bryant:
Perpendicular Rectangular Latin Arrays. 15-25 - An-Hang Chen, Jou-Ming Chang, Yue-Li Wang:
The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes. 27-34 - Daniel W. Cranston:
Multigraphs with Delta >= 3 are Totally-(2Delta-1)-Choosable. 35-40 - Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
A New Bound on the Total Domination Subdivision Number. 41-47 - A. D. Forbes, Mike J. Grannell, Terry S. Griggs:
Further 6-sparse Steiner Triple Systems. 49-64 - Akira Hiraki:
Distance-Regular Graph with c2 > 1 and a1 = 0 a2. 65-79 - Wilfried Imrich, Sandi Klavzar:
Transitive, Locally Finite Median Graphs with Finite Blocks. 81-90 - Ken-ichi Kawarabayashi, Michael D. Plummer:
Bounding the Size of Equimatchable Graphs of Fixed Genus. 91-99 - Toufik Mansour, Chunwei Song, Raphael Yuster:
A Comment on Ryser's Conjecture for Intersecting Hypergraphs. 101-109 - G. R. Omidi:
On the Nullity of Bipartite Graphs. 111-114 - R. S. Shewale, Vinayak Joshi, Vilas S. Kharat:
Frankl's Conjecture and the Dual Covering Property. 115-121 - Lingyan Zhen, Baoyindureng Wu:
List Point Arboricity of Dense Graphs. 123-128
Volume 25, Number 2, May 2009
- Ahmed Ainouche:
Dirac's Type Sufficient Conditions for Hamiltonicity and Pancyclicity. 129-137 - Sergey Bereg:
On Characterizations of Rigid Graphs in the Plane Using Spanning Trees - On Characterizations of Rigid Graphs in the Plane. 139-144 - Syed Ahtsham Ul Haq Bokhary, Ioan Tomescu, Akhlaq Ahmad Bhatti:
On the Chromaticity of Multi-Bridge Hypergraphs. 145-152 - Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon:
On the b-Coloring of Cographs and P4-Sparse Graphs. 153-167 - L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the Cubicity of Interval Graphs. 169-179 - Allan Frendrup, Preben D. Vestergaard, Anders Yeo:
Total Domination in Partitioned Graphs. 181-196 - Ellen Gethner, Thom Sulanke:
Thickness-Two Graphs Part Two: More New Nine-Critical Graphs, Independence Ratio, Cloned Planar Graphs, and Singly and Doubly Outerplanar Graphs. 197-217 - Ileana Streinu, Louis Theran:
Sparsity-certifying Graph Decompositions. 219-238 - Elmar Teufl, Stephan G. Wagner:
An Asymptotic Independence Theorem for the Number of Matchings in Graphs. 239-251 - Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices. 253-264
Volume 25, Number 3, August 2009
- Amir Rahnamai Barghi, Ilia Ponomarenko:
The Basis Digraphs of p-schemes. 265-271 - Yuanan Diao, Gábor Hetyei, Kenneth Hinson:
Invariants of Composite Networks Arising as a Tensor Product. 273-290 - Yi-Zheng Fan, Dan Yang:
The Signless Laplacian Spectral Radius of Graphs with Given Number of Pendant Vertices. 291-298 - Jinfeng Feng:
Each 3-strong Tournament Contains 3 Vertices Whose Out-arcs Are Pancyclic. 299-307 - John L. Goldwasser, William Klostermeyer:
Maximum Orbit Weights in the sigma-game and Lit-only sigma-game on Grids and Graphs. 309-326 - Ferran Hurtado, Criel Merino, Deborah Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On Polygons Enclosing Point Sets II. 327-339 - Hongxing Jiang, Liying Kang, Erfang Shan:
Total Restrained Domination in Cubic Graphs. 341-350 - Gyula Károlyi, Vera Rosta:
On Geometric Graph Ramsey Numbers. 351-363 - Frédéric Maffray, Meriem Mechebbek:
On b-perfect Chordal Graphs. 365-375 - Yannis Manoussakis:
Longest Cycles in 3-connected Graphs with Given Independence Number. 377-384 - Richard J. Nowakowski, Karen Seyffarth:
Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles. 385-400 - Lan Shen, Yingqian Wang:
On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles. 401-407
Volume 25, Number 4, November 2009
- Matthias Beck, Christian Haase, Steven V. Sam:
Grid Graphs, Gorenstein Polytopes, and Domino Stackings. 409-426 - Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto:
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. 427-460 - Steve Butler:
Induced-Universal Graphs for Graphs with Bounded Maximum Degree. 461-468 - Miguel Ángel Marco Buzunáriz:
A Description of the Resonance Variety of a Line Combinatorics via Combinatorial Pencils. 469-488 - Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon:
The Four-in-a-Tree Problem in Triangle-Free Graphs. 489-502 - Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Paired-Domination Subdivision Numbers of Graphs. 503-512 - Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich:
Upper Bounds for alpha-Domination Parameters. 513-520 - Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles. 521-531 - Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast Winning Strategies in Avoider-Enforcer Games. 533-544 - Eugen Mandrescu:
Building Graphs Whose Independence Polynomials Have Only Real Roots. 545-556 - N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran:
On the Structure of Contractible Edges in k-connected Partial k-trees. 557-569 - P. Paulraja, S. Sivasankar:
Directed Hamilton Cycle Decompositions of the Tensor Products of Symmetric Digraphs. 571-581 - Yuejian Peng:
On Substructure Densities of Hypergraphs. 583-600 - Jia Shen:
Subgraph Transversal of Graphs. 601-609 - Martin Sonntag, Hanns-Martin Teichert:
Competition Hypergraphs of Products of Digraphs. 611-624 - Bridget Eileen Tenner:
Domino Tiling Congruence Modulo 4. 625-638 - Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary:
Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs. 639-646
Volume 25, Number 5, November 2009
- József Balogh, Noah Prince:
Minimum Difference Representations of Graphs. 647-655 - Rong Chen, Kai-Nan Xiang:
A Note on Totally Free Matroids. 657-673 - Wayne Goddard, Michael A. Henning:
A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order. 675-692 - Johannes H. Hattingh, Ernst J. Joubert:
Restrained Domination in Claw-Free Graphs with Minimum Degree at Least Two. 693-706 - Alain Hertz, Dominique de Werra:
A Magnetic Procedure for the Stability Number. 707-716 - Mikio Kano, Gyula Y. Katona, Jácint Szabó:
Elementary Graphs with Respect to f-Parity Factors. 717-726 - Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar:
An Upper Bound for the Total Domination Subdivision Number of a Graph. 727-733 - Mingchao Li, Jingjing Huo, Zhichao Gao:
Maximum Packings and Minimum Coverings of Kv with Octagons. 735-752 - Yue Liu, Jing Huang:
Diameter-Preserving Spanning Trees in Sparse Weighted Graphs. 753-758 - Yuejian Peng:
On Jumping Densities of Hypergraphs. 759-766
Volume 25, Number 6, December 2009
- R. Julian R. Abel, Frank E. Bennett, M. Grüttmüller:
Super-simple, Pan-orientable, and Pan-decomposable BIBDs with Block Size 4 and Related Structures. 767-788 - Debra L. Boutin:
Determining Sets, Resolving Sets, and the Exchange Property. 789-806 - Csilla Bujtás, Zsolt Tuza:
Smallest Set-Transversals of k-Partitions. 807-816 - Qing Cui, Penny Haxell, Will Ma:
Packing and Covering Triangles in Planar Graphs. 817-824 - Diane M. Donovan, James G. Lefevre, Mary Waterhouse, Emine Sule Yazici:
On Defining Sets of Full Designs with Block Size Three. 825-839 - G. R. Omidi:
On Integral Graphs with Few Cycles. 841-849 - Haichao Wang, Liying Kang, Erfang Shan:
Matching Properties in Total Domination Vertex Critical Graphs. 851-861 - Xiaodong Xu, Zehui Shao, Wenlong Su, Zhenchong Li:
Set-coloring of Edges and Multigraph Ramsey Numbers. 863-870
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 2024-10-31 20:18 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:
