Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 112
Volume 112, Numbers 1-3, March 1993
- Joel Berman, Emil W. Kiss, Péter Pröhle, Ágnes Szendrei
:
The set of types of a finitely generated variety. 1-20 - Chong-Yun Chao, Zhibo Chen:
On uniquely 3-colorable graphs. 21-27 - Ciping Chen, Jianfang Wang:
Factors in graphs with odd-cycle property. 29-40 - Marston D. E. Conder:
Generating the Mathieu groups and associated Steiner systems. 41-47 - Peter Damaschke:
Paths in interval graphs and circular arc graphs. 49-64 - Marie-Pierre Delest, Jean-Marc Fedou:
Enumeration of skew Ferrers diagrams. 65-79 - Guoli Ding:
Disjoint circuits on a Klein bottle and a theorem on posets. 81-91 - Shuhong Gao, Wan-Di Wei:
On non-Abelian group difference sets. 93-102 - Arnold Knopfmacher, John Knopfmacher:
Counting irreducible factors of polynomials over a finite field. 103-118 - Leonid Libkin:
Direct product decompositions of lattices, closures and relation schemes. 119-138 - Dingjun Lou, Derek A. Holton:
Lower bound of cyclic edge connectivity for n-extendability of regular graphs. 139-150 - Tomasz Luczak:
The size of the largest hole in a random graph. 151-163 - Kevin T. Phelps, Christopher A. Rodger:
Nesting partial Steiner triple systems with 2-regular leave graphs. 165-172 - A. G. Robinson, Alan J. Goldman:
The isolation game for regular graphs. 173-184 - José Rodríguez, Appajosyula Satyanarayana:
A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability. 185-197 - Zsolt Tuza:
Multipartite Turán problem for connected graphs and hypergraphs. 199-206 - Marcel Wild:
Cover preserving embedding of modular lattices into partition lattices. 207-244 - Hervé Chabanne, Nicolas Sendrier:
On the concatenated structures of a [49, 18, 12] binary abelian code. 245-248 - Bradley W. Brock:
A new construction of circulant GH(p2;Zp). 249-252 - Guantao Chen:
Hamiltonian graphs involving neighborhood intersections. 253-257 - Peter Dolan, Mark D. Halsey:
Random edge domination. 259-260 - Guo-Gang Gao:
On consecutive numbers of the same height in the Collatz problem. 261-267 - Zsolt Lengvárszky:
Distributive sublattices and weakly independent subsets in modular lattices. 269-273 - Frédéric Maffray:
Antitwins in partitionable graphs. 275-278 - Bojan Mohar:
7-critical graphs of bounded genus. 279-281 - Raffaele Scapellato:
A characterization of bipartite graphs associated with BIB-designs with lambda = 1. 283-287 - S. Sridharan:
On the Berge's strong path partition conjecture. 289-293 - Huishan Zhou:
Inequalities with respect to graph homomorphism. 295-298
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-04-25 05:29 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:
