Issue icon
Issue

2009/29/3

Journal: Discussiones Mathematicae Graph Theory
Year: 2009
Volume: 29
Number: 3

Articles

423-467

On transitive orientations of G-ê

  • Michael Andresen
469-480

Independent transversals of longest paths in locally semicomplete and locally transitive digraphs

  • Hortensia Galeana-Sánchez
  • Ricardo Gómez
  • Juan Montellano-Ballesteros
481-498

On Lee's conjecture and some results

  • Lixia Fan
  • Zhihe Liang
499-510

The list linear arboricity of planar graphs

  • Xinhui An
  • Baoyindureng Wu
511-519

Minimum congestion spanning trees of grids and discrete toruses

  • Alberto Castejón
  • Mikhail Ostrovskii
521-543

Colouring vertices of plane graphs under restrictions given by faces

  • Július Czap
  • Stanislav Jendrol'
545-561

The set chromatic number of a graph

  • Gary Chartrand
  • Futaba Okamoto
  • Craig Rasmussen
  • Ping Zhang
563-572

Decompositions of nearly complete digraphs into t isomorphic parts

  • Mariusz Meszka
  • Zdzisław Skupień
573-581

(H,k) stable bipartite graphs with minimum size

  • Aneta Dudek
  • Małgorzata Zwonek
583-596

Potentially H-bigraphic sequences

  • Michael Ferrara
  • Michael Jacobson
  • John Schmitt
  • Mark Siggers
597-613

Bounds on the global offensive k-alliance number in graphs

  • Mustapha Chellali
  • Teresa Haynes
  • Bert Randerath
  • Lutz Volkmann
615-627

Relations between the domination parameters and the chromatic index of a graph

  • Włodzimierz Ulatowski
629-644

Forbidden-minor characterization for the class of graphic element splitting matroids

  • Kiran Dalvi
  • M. Borse
  • M. Shikare
645-650

Pairs of forbidden class of subgraphs concerning K1,3 and P₆ to have a cycle containing specified vertices

  • Takeshi Sugiyama
  • Masao Tsugaki
651-656

Packing of nonuniform hypergraphs - product and sum of sizes conditions

  • Paweł Naroski