default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 165-166
Volume 165-166, March 1997
- Jean-Luc Fouquet, Pierre Rosenstiehl:
Preface. 1-2 - Vasek Chvátal:
In praise of Claude Berge. 3-9 - Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Amel Harkat-Benhamdine, Hao Li:
Dlambda-cycles in lambda-claw-free graphs. 11-20 - Demetrios Achlioptas:
The complexity of G-free colourability. 21-30 - Noga Alon, Zsolt Tuza, Margit Voigt:
Choosability and fractional chromatic numbers. 31-38 - Jørgen Bang-Jensen
, Gregory Z. Gutin:
Alternating cycles and paths in edge-coloured multigraphs: A survey. 39-60 - Claude Berge:
Motivations and history of some of my conjectures. 61-70 - J. Adrian Bondy:
Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture. 71-80 - Endre Boros, Ondrej Cepek:
On perfect 0, +/- 1 matrices, . 81-100 - Mustapha Bouchakour, Ali Ridha Mahjoub:
One-node cutsets and the dominating set polytope. 101-123 - Josep M. Brunat, Montserrat Maureso, M. Mora:
Characterization of c-circulant digraphs of degree two which are circulant. 125-137 - Irène Charon, A. Guénoche, Olivier Hudry, Frédéric Woirgard:
New results on the computation of median orders. 139-153 - Raul Cordovil:
Coloring matroids. 155-160 - Dominique de Werra:
Restricted coloring models for timetabling. 161-170 - Charles Delorme, Jean-Pierre Tillich:
Eigenvalues, eigenspaces and distances to subsets. 171-194 - Walter A. Deuber, Xuding Zhu:
The chromatic numbers of distance graphs. 195-204 - Michel Deza, Viatcheslav P. Grishukhin:
The skeleton of the 120-cell is not 5-gonal. 205-210 - Guoli Ding, Peter L. Hammer:
Matroids arisen from matrogenic graphs. 211-217 - Jack Edmonds, Monique Laurent, Alexander Schrijver:
A minor-monotone graph parameter based on oriented matroids. 219-226 - Paul Erdös:
Some old and new problems in various branches of combinatorics. 227-231 - Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed:
Path parity and perfection. 233-252 - Odile Favaron, Y. Redouane:
Minimum independent generalized t-degree and independence number in K1, r+1-free graphs. 253-261 - Herbert Fleischner:
A numbering of the vertices of special networks. 263-276 - Jean-Luc Fouquet, Vassilis Giakoumakis:
On semi-P4-sparse graphs. 277-300 - Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier:
On transversals in minimal imperfect graphs. 301-312 - Jean-Claude Fournier:
Tiling pictures of the plane with dominoes. 313-320 - Vassilis Giakoumakis, Florian Roussel, Henri Thuillier:
Scattering number and modular decomposition. 321-342 - John Gimbel, Maryvonne Mahéo, Christine Virlouvet:
Double total domination of graphs. 343-351 - Sylvain Gravier, Frédéric Maffray:
Choice number of 3-colorable elementary graphs. 353-358 - Harald Gropp:
Blocking set free configurations and their relations to digraphs and hypergraphs. 359-370 - Ervin Györi:
C6-free bipartite graphs and product representation of squares. 371-375 - Malika Hadjiat, Jean François Maurras:
A strongly polynomial algorithm for the minimum cost tension problem. 377-394 - Yahya Ould Hamidoune, Michel Las Vergnas:
Directed switching games II The Arborescence Game. 395-402 - Pierre Hansen, Alain Hertz, Nicolas Quinodoz:
Splitting trees. 403-419 - Stefan Hougardy:
Perfect graphs with unique P4-structure. 421-430 - Martin Klazar:
Combinatorial aspects of Davenport-Schinzel sequences. 431-445 - Jean-Marie Laborde, Rafaï Mourad Madani:
Generalized hypercubes and (0, 2)-graphs. 447-459 - Bruno Leclerc:
Families of chains of a poset and Sperner properties. 461-468 - Hao Li, Mei Lu, Feng Tian, Bing Wei:
Hamiltonicity of 2-connected claw-center independent graphs. 469-479 - Jean François Maurras, Yann Vaxès:
Multicommodity network flow with jump constraints. 481-486 - Lorenzo Milazzo:
The monochromatic block number. 487-496 - Bernard Monjardet, Nathalie Caspard:
On a dependence relation in finite lattices. 497-505 - Haiko Müller, Jean-Xavier Rampon:
Partial orders and their convex subsets. 507-517 - Jarik Nesetril, André Raspaud, Éric Sopena:
Colorings and girth of oriented planar graphs. 519-530 - Manfred Padberg, Ting-Yi Sung:
An analytic symmetrization of max flow-min cut. 531-545 - Renaud Palisse:
Subsets of a finite set that almost always intersect each other in lambda elements. 547-553 - Charles Payan:
Empilement de cercles égaux dans un triangle équilatéral a propos d'une conjecture d'Erdös-Oler. 555-565 - Ljubomir Perkovic, Bruce A. Reed:
Edge coloring regular graphs of high degree. 567-578 - Pascal Préa:
About weak connectivity. 579-586 - Gerhard Ringel, Anna S. Lladó, Oriol Serra:
On the tree number of regular graphs. 587-595 - Horst Sachs:
Graph theory in organic chemistry: problems and methods in the chemistry of carbon footballs and tubes (fullerenes). 597-598 - Jean-François Saclé, Mariusz Wozniak:
On graphs which contain each tree of given size. 599-605 - Carsten Thomassen:
Dirac's conjecture on K5-subdivisions. 607-608 - Olivier Togni:
Irregularity strength of the toroidal grid. 609-620 - A. Pawel Wojda, Irmina A. Ziolo:
Embedding digraphs of small size. 621-638 - Yohei Yamasaki:
The arithmetic of reversed positional games. 639-641
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-12-27 21:16 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:
