Discrete Mathematics

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
pp. 1-12(12)
Authors: Bang-Jensen J.; Gutin G.; Huang J.

Suzuki groups, one-factorizations and Luneburg planes
pp. 13-24(12)
Authors: Bonisoli A.; Korchmaros G.

Connectivity and -invariants of isotropic systems and 4-regular graphs
pp. 25-44(20)
Authors: Bouchet A.; Ghier L.

The center of an infinite graph
pp. 45-52(8)
Authors: Boza L.; Dianez A.; Marquez A.

Cut and patch Steiner trees for ladders
pp. 53-61(9)
Authors: Burkard R.E.; Dudas T.; Maier T.

Graph-theoretical conditions for inscribability and Delaunay realizability
pp. 63-77(15)
Authors: Dillencourt M.B.; Smith W.D.

Convergence of sequences of iterated triangular line graphs
pp. 79-86(8)
Author: Dorrough D.

On values in relatively normal lattices
pp. 87-100(14)
Authors: Filipoiu A.; Georgescu G.

A bijection between Proctor's and Sundaram's odd orthogonal tableaux
pp. 101-120(20)
Authors: Fulmek M.; Krattenthaler C.

Distances between graphs under edge operations
pp. 121-132(12)
Authors: Goddard W.; Swart H.C.

Infinite self-similar words
pp. 133-141(9)
Author: Grytczuk J.

Clique-gated graphs
pp. 143-149(7)
Authors: Hagauer J.; Klavzar S.

Idempotents, regular elements and sequences from finite semigroups
pp. 151-160(10)
Authors: Hall T.E.; Sapir M.V.

The diversity of domination
pp. 161-173(13)
Authors: Pariente F.; Yong S.K.; Henning M.A.; Oellermann O.R.; Swart H.C.

Local edge domination critical graphs
pp. 175-184(10)
Authors: Henning M.A.; Oellermann O.R.; Swart H.C.

A proof of a conjecture about D-paths in graphs with large neighborhood unions
pp. 185-196(12)
Authors: Jianping L.; Feng T.

T-graphs and the channel assignment problem
pp. 197-205(9)
Author: Liu D.D.-F.

Hamiltonian properties and the bipartite independence number
pp. 207-215(9)
Authors: Ordaz O.; Amar D.; Raspaud A.

The structure of quasi 4-connected graphs
pp. 217-228(12)
Authors: Politof T.; Satyanarayana A.

A sufficient condition for graphs with large neighborhood unions to be traceable
pp. 229-234(6)
Author: Ren S.

Strong weak domination and domination balance in a graph
pp. 235-242(8)
Authors: Sampathkumar E.; Latha L.P.

Recursively decomposable well-covered graphs
pp. 243-263(21)
Authors: Sankaranarayana R.S.; Stewart L.K.

Line hypergraphs
pp. 265-283(19)
Authors: Tyshkevich R.I.; Zverovich V.E.

On indexable graphs
pp. 285-289(5)
Authors: Arumugam S.; Germina K.A.

Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes
pp. 291-295(5)
Author: Buratti M.

A cyclically 6-edge-connected snark of order 118
pp. 297-300(4)
Author: Kochol M.

Asymptotics for Morgan numbers of fractional orders
pp. 301-308(8)
Authors: Kreinin A.; Vainshtein A.

A characterization of root lattices
pp. 309-314(6)
Authors: Rajan D.S.; Shende A.M.

Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs
pp. 315-315(1)
Author: Steffen E.

On Chebyshev's inequality for sequences
pp. 317-322(6)
Author: Toader G.

Characterization of self-complementary symmetric digraphs
pp. 323-327(5)
Author: Hong Z.