Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 111
Volume 111, Numbers 1-3, February 1993
- Claude Berge:
Preface. 1 - Yousef Alavi, Jiuqiang Liu, Jianfang Wang:
Highly irregular digraphs. 3-10 - Brian Alspach, Cun-Quan Zhang:
Cycle covers of cubic multigraphs. 11-17 - Denise Amar:
Applying a condition for a hamiltonian bipartite graph to be bipancyclic. 19-25 - Annie Astié-Vidal, Vincent Dugat:
Autonomous parts and decomposition of regular tournaments. 27-36 - Gábor Bacsó, Zsolt Tuza:
Domination properties and induced subgraphs. 37-40 - L. Balcza:
Sum of lengths of inversions in permutations. 41-48 - Jean-Pierre Barthélemy, Julien Constantin:
Median graphs, parallelism and posets. 49-63 - Joaquim Borges
, Josep Rifà:
A note about multidesigns and extended designs. 65-69 - Mieczyslaw Borowiecki, Ewa Drgas-Burchardt:
Classes of chromatically unique graphs. 71-75 - Claude Carlet:
A general case of normal duality between binary nonlinear codes. 77-85 - Yair Caro, Zsolt Tuza:
Bounded degrees and prescribed distances in graphs. 87-93 - I. M. Chakravarti:
Geometric construction of some families of two-class and three-class association schemes and codes from nondegenerate and degenerate Hermitian varieties. 95-103 - C. Chameni Nembua, Bernard Monjardet:
Finite pseudocomplemented lattices and 'permutoedre'. 105-112 - C. C. Chen, Khee Meng Koh, Y. H. Peng:
On the higher-order edge toughness of a graph. 113-123 - Fan R. K. Chung, Ronald L. Graham:
On hypergraphs having evenly distributed subhypergraphs. 125-129 - Raul Cordovil, M. L. Moreira:
A homotopy theorem on oriented matroids. 131-136 - Ilda P. F. da Silva:
On fillings of 2N-gons with rhombi. 137-144 - Charles Delorme, Svatopluk Poljak:
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. 145-156 - József Dénes, Gary L. Mullen:
Enumeration formulas for latin and frequency squares. 157-163 - Roger B. Eggleton, Aviezri S. Fraenkel, R. Jaime Simpson:
Beatty sequences and Langford sequences. 165-178 - Péter L. Erdös:
A new bijection on rooted forests. 179-188 - Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa:
The grid revisted. 189-196 - Odile Favaron, Maryvonne Mahéo, Jean-François Saclé:
Some eigenvalue properties in graphs (conjectures of Graffiti - II). 197-220 - Evelyne Flandrin, Jean-Luc Fouquet, Hao Li:
On hamiltonian claw-free graphs. 221-229 - András Frank:
Submodular functions in graph theory. 231-243 - Komei Fukuda, Keiichi Handa:
Antipodal graphs and oriented matroids. 245-256 - Christine Garcia, Patrick Solé:
Diameter lower bounds for Waring graphs and multiloop networks. 257-261 - Mario Gionfriddo, Giovanni Lo Faro:
2-Colourings in S(t, t + 1, v). 263-268 - Harald Gropp:
Configurations and graphs. 269-276 - A. Guénoche:
Enumération des partitions de diamètre minimum. 277-287 - Michel Habib, Michel Morvan, Jean-Xavier Rampon:
On the calculation of transitive reduction - closure of orders. 289-303 - Pierre Hansen, Alain Hertz, Julio Kuplinsky:
Bounded vertex colorings of graphs. 305-312 - Pavol Hell, Karen Seyffarth:
Largest planar graphs of diameter two and fixed maximum degree. 313-322 - Anthony J. W. Hilton:
Recent results on the total chromatic number. 323-331 - Philippe Jégou, Marie-Catherine Vilarem:
On some partial line graphs of a hypergraph and the associated matroid. 333-344 - Bruno Leclerc:
Lattice valuations, medians and majorities. 345-356 - Bernt Lindström:
On algebraic matroids. 357-359 - Nadimpalli V. R. Mahadev, Ph. Solot, Dominique de Werra:
The cyclic compact open-shop scheduling problem. 361-366 - Frédéric Maire:
Une note sur les contractions dans les polygones orthogonaux. 367-371 - Jean François Maurras:
Hypergraphes de Petersen! Hypergraphes de Moore? 373-379 - Jean Mayer:
Case 6 of hadwiger's conjecture. III. The problem of 7-vertices. 381-387 - Colin J. H. McDiarmid, Abdón Sánchez-Arroyo:
An upper bound for total colouring of graphs. 389-392 - Matthias Middendorf, Frank Pfeiffer:
Weakly transitive orientations, Hasse diagrams and string graphs. 393-400 - Haruko Okamura:
Paths containing two adjacent edges in (2k+1)-edge-connected graphs. 401-407 - Manfred Padberg:
Lehman's forbidden minor characterization of ideal 0-1 matrices. 409-420 - Renaud Palisse:
A short proof of fisher's inequality. 421-422 - Svatopluk Poljak:
On existence theorems. 423-434 - Alain Quilliot:
Une extension du problème du point fixe pour des graphes simples. 435-445 - André Raspaud:
Postman tours and cycle covers. 447-454 - Ingo Schiermeyer:
Computation of the 0-dual closure for hamiltonian graphs. 455-464 - Marc Wagowski:
Coordinatization of B-matroids. 465-479 - Yohei Yamasaki:
Shannon-like games are difficult. 481-483
a service of 
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-05-06 20:15 CEST 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:
