default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 13
Volume 13, Number 1, March 1997
- Peter Adams, Darryn E. Bryant
, Saad I. El-Zanati, Charles Vanden Eynden:
d-Cube decompositions ofKn/Km. 1-7 - Martin Aigner, Anping Li:
Searching for counterfeit coins. 9-20 - Benjamin V. C. Collins:
The girth of a thin distance-regular graph. 21-30 - Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto:
On the structure of bull-free perfect graphs. 31-55 - Hortensia Galeana-Sánchez, Sergio Rajsbaum:
Cycle-pancyclism in tournaments III. 57-63 - Pavol Hell, Jing Huang:
Two remarks on circular arc graphs. 65-72 - Jun Kyo Kim, Sang Geun Hahn:
Partitions of bipartite numbers. 73-78 - Tsuyoshi Nishimura:
A new recursive theorem onn-extendibility. 79-83 - Colin Ramsay, Douglas G. Rogers:
The problem of irregular perfect systems of sets of iterated differences. 85-94
Volume 13, Number 2, June 1997
- Richard P. Anstee, Jerrold R. Griggs, Attila Sali:
Small Forbidden Configurations. 97-118 - Louis Caccetta, Rui-Zhong Jia:
Binary Labeling of Graphs. 119-137 - Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp:
A Class of Edge Critical 4-Chromatic Graphs. 139-146 - Sheshayya A. Choudum, B. Ponnusamy:
Ordered and Canonical Ramsey Numbers of Stars. 147-158 - Eduardo Rivera-Campo:
A Note on Matchings and Spanning Trees with Bounded Degrees. 159-165 - Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
On Planar Perfectly Contractile Graphs. 167-187 - K. Sekine, Cun-Quan Zhang:
Decomposition of the Flow Polynomial. 189-196 - Van H. Vu:
Extremal Systems with Upper-Bounded Odd Intersections. 197-208
Volume 13, Number 3, September 1997
- Gabriela Alexe, E. Olaru:
The Strongly Perfectness of Normal Product of t-Perfect Graphs. 209-215 - Noga Alon, Michael Krivelevich:
Constructive Bounds for a Ramsey-Type Problem. 217-225 - Darryn E. Bryant:
2m-Cycle Systems of K 2m+1\C m. 227-229 - Paul H. Edelman, Victor Reiner:
Catalan Triangulations of the Möbius Band. 231-243 - Igor Fabrici, Stanislav Jendrol':
Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs. 245-250 - Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa:
Orthogonal Double Covers of Complete Graphs by Trees. 251-262 - Francisco Larrión, Victor Neumann-Lara:
A Family of Clique Divergent Graphs with Linear Growth. 263-266 - Charles H. C. Little, Kee L. Teo, Hong Wang:
On a Conjecture on Directed Cycles in a Directed Bipartite Graph. 267-273 - Ladislav Stacho:
A New Chvátal Type Condition for Pancyclicity. 275-280 - Benny Sudakov:
A Note on τ-Critical Linear Hypergraphs. 281-285 - Shaoji Xu:
Chromaticity of Chordal Graphs. 287-294 - Heping Zhang, Fuji Zhang:
Perfect Matchings of Polyomino Graphs. 295-304
Volume 13, Number 4, December 1997
- Saieed Akbari, Mehdi Behzad, Hossein Hajiabolhassan, Ebadollah S. Mahmoodian:
Uniquely Total Colorable Graphs. 305-314 - David W. Barnette:
Cycle Covers of Planar 2-Edge-Connected Graphs. 315-323 - Guantao Chen, Michael S. Jacobson:
Degree Sum Conditions for Hamiltonicity on k-Partite Graphs. 325-343 - Arthur M. Farley, Andrzej Proskurowski:
Minimum Self-Repairing Graphs. 345-351 - Jerrold W. Grossman:
Spanning Star Trees in Regular Graphs. 353-358 - Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Recognizing Intersection Graphs of Linear Uniform Hypergraphs. 359-367 - Antonio Sassano:
Chair-Free Berge Graphs Are Perfect. 369-395
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 2025-12-04 01:27 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:
