Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 12
Volume 12, Number 1, December 1996
- J. H. Cho, Edgar M. Palmer:
On the asymptotic behavior of the independence number of a random (n, n)-tree. 1-8 - Hortensia Galeana-Sánchez, Sergio Rajsbaum:
Cycle-pancyclism in tournaments II. 9-16 - Wayne Goddard:
The toughness of cubic graphs. 17-22 - Akira Hiraki:
A constant bound on the number of columns (1, k - 2, 1) in the intersection array of a distance-regular graph. 23-37 - Haruo Ishibashi:
The Terwilliger algebras of certain association schemes over the Galois rings of characteristic 4. 39-54 - Ryuzaburo Noda:
An inequality for steiner systems II. 55-58 - Talmage James Reid:
On fixing edges in graph minors. 59-68 - Andrew Vince
, Yongzhi Yang:
Reconstruction of the set of branches of a graph. 69-80 - Dominique de Werra, Jacques Erschler:
Open shop scheduling with some additional constraints. 81-93 - Rudolf Ahlswede, Levon H. Khachatrian:
Optimal pairs of incomparable clouds in multisets. 97-137 - David W. Barnette:
Generating the centrally symmetric 3-polyhedral graphs. 139-147 - Tom C. Brown, Bruce M. Landman:
The Ramsey property for collections of sequences not containing all arithmetic progressions. 149-161 - Italo J. Dejter:
TMC tetrahedral types MOD 2k + 1 and their structure graphs. 163-178 - Qiongxiang Huang, Jixiang Meng:
On the isomorphisms and automorphism groups of circulants. 179-187 - Seiya Negami, Katsuhiro Ota:
Polynomial invariants of graphs II. 189-198 - Tiong-Seng Tay:
Some results on generalized Latin Squares. 199-207 - Armen S. Asratian, G. V. Sarkisian:
Some panconnected and pancyclic properties of graphs with a local ore-type condition. 209-219 - Feng Ming Dong, Y. P. Liu:
On the chromatic uniqueness of the graphW(n, n - 2, k). 221-230 - Jan van den Heuvel:
Extensions and consequences of Chvátal-Erdős' theorem. 231-237 - Jin Ho Kwak, Jaeun Lee, Moo Young Sohn:
Isoperimetric numbers of graph bundles. 239-251 - Francis Maurin:
Incomplete orthogonal arrays and idempotent orthogonal arrays. 253-266 - Fred R. McMorris, Chi Wang:
Modular intersection graphs. 267-281 - Thomas Meixner, Antonio Pasini:
A family of multiply extended grids. 283-293 - Michael Reid:
On the connectivity of unit distance graphs. 295-303 - Dalibor Froncek:
Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters. 305-320 - Min-Jen Jou, Gerard J. Chang, Chiang Lin, Tze-Heng Ma:
A finiteness theorem for maximal independent sets. 321-326 - P. Katerinis, N. Tsikopoulos:
Perfect matchings in regular bipartite graphs. 327-331 - Khee Meng Koh, B. P. Tan:
The minimum diameter of orientations of complete multipartite graphs. 333-339 - Hiroshi Maehara, Norihide Tokushige:
A spatial unit-bar-framework which is rigid and triangle-free. 341-344 - Yannis Manoussakis, Michael Spyratos, Zsolt Tuza, Margit Voigt:
Minimal colorings for properly colored subgraphs. 345-360 - Ladislav Stacho:
Maximally non-hamiltonian graphs of girth 7. 361-371 - Hong Wang:
On long cycles in a 2-connected bipartite graph. 373-384 - Bing Wei:
Hamiltonian cycles in 1-tough graphs. 385-395
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-22 20:02 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:
