Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discussiones Mathematicae. Graph Theory
Tome 29 (2009)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Strongly pancyclic and dual-pancyclic graphs
McKee, Terry
p. 5-14
Variable neighborhood search for extremal graphs. 17. Further conjectures and results about the index
Aouchiche, Mustapha
;
Hansen, Pierre
;
Stevanović, Dragan
p. 15-37
k-Kernels and some operations in digraphs
Galeana-Sanchez, Hortensia
;
Pastrana, Laura
p. 39-49
Convex independence and the structure of clone-free multipartite tournaments
Parker, Darren
;
Westhoff, Randy
;
Wolf, Marty
p. 51-69
Restrained domination in unicyclic graphs
Hattingh, Johannes
;
Joubert, Ernst
;
Loizeaux, Marc
;
Plummer, Andrew
;
van der Merwe, Lucas
p. 71-86
Decompositions of quadrangle-free planar graphs
Borodin, Oleg
;
Ivanova, Anna
;
Kostochka, Alexandr
;
Sheikh, Naeem
p. 87-99
Kernels and cycles' subdivisions in arc-colored tournaments
Delgado-Escalante, Pietra
;
Galeana-Sánchez, Hortensia
p. 101-117
Equitable coloring of Kneser graphs
Fidytek, Robert
;
Furmańczyk, Hanna
;
Żyliński, Paweł
p. 119-142
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
Broersma, Hajo
;
Marchal, Bert
;
Paulusma, Daniel
;
Salman, A.
p. 143-162
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Cranston, Daniel
p. 163-178
Quasiperfect domination in triangular lattices
Dejter, Italo
p. 179-198
A note on k-uniform self-complementary hypergraphs of given order
Szymański, Artur
;
Wojda, A.
p. 199-202
Sommaire du
Fascicule no. 2
Multicolor Ramsey numbers for some paths and cycles
Bielak, Halina
p. 209-218
Acyclic reducible bounds for outerplanar graphs
Borowiecki, Mieczysław
;
Fiedorowicz, Anna
;
Hałuszczak, Mariusz
p. 219-239
On infinite uniquely partitionable graphs and graph properties of finite character
Bucko, Jozef
;
Mihók, Peter
p. 241-251
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
Dereniowski, Dariusz
p. 253-261
Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties
Drgas-Burchardt, Ewa
p. 263-274
On odd and semi-odd linear partitions of cubic graphs
Fouquet, Jean-Luc
;
Thuillier, Henri
;
Vanherpe, Jean-Marie
;
Wojda, Adam
p. 275-292
On normal partitions in cubic graphs
Fouquet, Jean-Luc
;
Vanherpe, Jean-Marie
p. 293-312
Directed hypergraphs: a tool for researching digraphs and hypergraphs
Galeana-Sánchez, Hortensia
;
Manrique, Martín
p. 313-335
Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs
Galeana-Sánchez, Hortensia
;
Rojas-Monroy, R.
;
Zavala, B.
p. 337-347
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments
Galeana-Sánchez, Hortensia
;
Rojas-Monroy, R.
;
Zavala, B.
p. 349-360
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Giaro, Krzysztof
;
Kubale, Marek
p. 361-376
On -independence in graphs
Göring, Frank
;
Harant, Jochen
;
Rautenbach, Dieter
;
Schiermeyer, Ingo
p. 377-383
On local structure of 1-planar graphs of minimum degree 5 and girth 4
Hudák, Dávid
;
Madaras, Tomás
p. 385-400
On universal graphs for hom-properties
Mihók, Peter
;
Miškuf, Jozef
;
Semanišin, Gabriel
p. 401-409
On k-intersection edge colourings
Muthu, Rahul
;
Narayanan, N.
;
Subramanian, C.
p. 411-418
Sommaire du
Fascicule no. 3
On transitive orientations of G-ê
Andresen, Michael
p. 423-467
Independent transversals of longest paths in locally semicomplete and locally transitive digraphs
Galeana-Sánchez, Hortensia
;
Gómez, Ricardo
;
Montellano-Ballesteros, Juan
p. 469-480
On Lee's conjecture and some results
Fan, Lixia
;
Liang, Zhihe
p. 481-498
The list linear arboricity of planar graphs
An, Xinhui
;
Wu, Baoyindureng
p. 499-510
Minimum congestion spanning trees of grids and discrete toruses
Castejón, Alberto
;
Ostrovskii, Mikhail
p. 511-519
Colouring vertices of plane graphs under restrictions given by faces
Czap, Július
;
Jendrol', Stanislav
p. 521-543
The set chromatic number of a graph
Chartrand, Gary
;
Okamoto, Futaba
;
Rasmussen, Craig
;
Zhang, Ping
p. 545-561
Decompositions of nearly complete digraphs into t isomorphic parts
Meszka, Mariusz
;
Skupień, Zdzisław
p. 563-572
(H,k) stable bipartite graphs with minimum size
Dudek, Aneta
;
Zwonek, Małgorzata
p. 573-581
Potentially H-bigraphic sequences
Ferrara, Michael
;
Jacobson, Michael
;
Schmitt, John
;
Siggers, Mark
p. 583-596
Bounds on the global offensive k-alliance number in graphs
Chellali, Mustapha
;
Haynes, Teresa
;
Randerath, Bert
;
Volkmann, Lutz
p. 597-613
Relations between the domination parameters and the chromatic index of a graph
Ulatowski, Włodzimierz
p. 615-627
Forbidden-minor characterization for the class of graphic element splitting matroids
Dalvi, Kiran
;
Borse, M.
;
Shikare, M.
p. 629-644
Pairs of forbidden class of subgraphs concerning
$K_{1,3}$
and P₆ to have a cycle containing specified vertices
Sugiyama, Takeshi
;
Tsugaki, Masao
p. 645-650
Packing of nonuniform hypergraphs - product and sum of sizes conditions
Naroski, Paweł
p. 651-656