서울대학교 외국학술지지원센터(FRIC)

서울대학교 외국학술지지원센터(FRIC)는 국내 모든 연구자에게 자연과학 분야 원문복사 서비스를 무료로 제공하고 있습니다.

CURRENT CONTENTS/Mathmatics

AUSTRALASIAN Journal OF COMBINATORICS v.49 2011

seoulfric 2011. 5. 16. 10:59


ISSN 1034-4942

  • Nirmala Achuthan, N.R. Achuthan and M. Simanihuruk
    • The Nordhaus-Gaddum problem for the $k$-defective chromatic number of a $P_4$-free graph, p.3
  • R. Sampathkumar and M. Simaringa
    • Orthogonal double covers of complete bipartite graphs, p.15
  • Jonathan L. Gross
    • Genus distribution of graph amalgamations: self-pasting at root-vertices, p.19
  • Ralucca Gera and Pantelimon St{u}anic{u}a
    • The spectrum of generalized Petersen graphs, p.39
  • Anders Claesson, Mark Dukes and Sergey Kitaev
    • A direct encoding of Stoimenows matchings as ascent sequences, p.47
  • Saad El-Zanati, Kyle King and Jeff Mudrock
    • On the cyclic decomposition of circulant graphs into almost-bipartite graphs, p.61
  • D.A. Preece and E.R. Vaughan
    • Daisy chains with four generators, p.77
  • James East and Peter J. McNamara
    • On the work performed by a transformation semigroup, p.95
  • Christina Graves
    • Inflection points of coherent reliability polynomials, p.111
  • B.B. Bobga, J.L. Goldwasser, A.J.W. Hilton and P.D. Johnson Jr.
    • Completing partial latin squares: Cropper's question, p.127
  • Andreas Holtkamp
    • Maximal local edge-connectivity of diamond-free graphs, p.153
  • Stefano Innamorati
    • A characterization of the set of lines either external to or secant to an ovoid in PG$(3,q)$, p.159
  • J. Lauri, R. Mizzi and R. Scapellato
    • Two-fold automorphisms of graphs, p.165
  • Geoffrey Exoo, Ville Junnila and Tero Laihonen
    • Locating-dominating codes in cycles, p.177
  • L'udov{'i}t Niepel and Martin Knor
    • Efficient open domination in digraphs, p.195
  • S.R. Kingan
    • Stabilizers for GF$(5)$-representable matroids, p.203
  • Araya Chaemchan
    • Bounds on the arboricities of connected graphs, p.209
  • Xueliang Li and Yuefang Sun
    • On the rainbow $k$-connectivity of complete graphs, p.217
  • J. Richard Lundgren and Breeann Flesch
    • A characterization of $k$-trees that are interval $p$-graphs, p.227
  • L'aszl'o Major
    • On the distribution of coefficients of powers of positive polynomials, p.239
  • Steffen Gr"uter, Andreas Holtkamp and Michel Surmacs
    • On set colorings of complete bipartite graphs, p.245
  • Fi-yi Wei and Muhuo Liu
    • Ordering of the signless Laplacian spectral radii of unicyclic graphs, p.255
  • Szil{'a}rd Andr{'a}s
    • A combinatorial generalization of Wilson's theorem, p.265