Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 49
Volume 49, February 2011
- Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk:
The Nordhaus-Gaddum problem for the k-defective chromatic number of a P4-free graph. 3-14 - R. Sampathkumar, M. Simaringa:
Orthogonal double covers of complete bipartite graphs. 15-18 - Jonathan L. Gross:
Genus distribution of graph amalgamations: self-pasting at root-vertices. 19-38 - Ralucca Gera, Pantelimon Stanica:
The spectrum of generalized Petersen graphs. 39-46 - Anders Claesson, Mark Dukes, Sergey Kitaev:
A direct encoding of Stoimenows matchings as ascent sequences. 47-60 - Saad I. El-Zanati, Kyle King, Jeff Mudrock:
On the cyclic decomposition of circulant graphs into almost-bipartite graphs. 61-76 - Donald A. Preece, Emil R. Vaughan:
Daisy chains with four generators. 77-94 - James East, Peter J. McNamara:
On the work performed by a transformation semigroup. 95-110 - Christina Graves:
Inflection points of coherent reliability polynomials. 111-126 - B. B. Bobga, John L. Goldwasser, Anthony J. W. Hilton, Peter D. Johnson Jr.:
Completing partial latin squares: Cropper's question. 127-152 - Andreas Holtkamp:
Maximal local edge-connectivity of diamond-free graphs. 153-158 - Stefano Innamorati:
A characterization of the set of lines either external to or secant to an ovoid in PG(3, q). 159-164 - Josef Lauri, Russell Mizzi, Raffaele Scapellato:
Two-fold automorphisms of graphs. 165-176 - Geoffrey Exoo, Ville Junnila, Tero Laihonen:
Locating-dominating codes in cycles. 177-194 - Ludovít Niepel, Martin Knor:
Efficient open domination in digraphs. 195-202 - Sandra R. Kingan:
Stabilizers for GF(5)-representable matroids. 203-208 - Araya Chaemchan:
Bounds on the arboricities of connected graphs. 209-216 - Xueliang Li, Yuefang Sun:
On the rainbow k-connectivity of complete graphs. 217-226 - J. Richard Lundgren, Breeann Flesch:
A characterization of k-trees that are interval p-graphs. 227-238 - László Major:
On the distribution of coefficients of powers of positive polynomials. 239-244 - Steffen Grüter, Andreas Holtkamp, Michel Surmacs:
On set colorings of complete bipartite graphs. 245-254 - Fi-yi Wei, Muhuo Liu:
Ordering of the signless Laplacian spectral radii of unicyclic graphs. 255-264 - Szilárd András:
A combinatorial generalization of Wilson's theorem. 265-
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-18 21:19 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:
