Journals in DBLP
Jean-Luc Fouquet , Irena Rusu Preface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:1-2 [Journal ] Guest Editors. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:3-0 [Journal ] Jørgen Bang-Jensen , Tibor Jordán Splitting off edges between two subsets preserving the edge-connectivity of the graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:5-28 [Journal ] Halina Bielak Local Ramsey numbers for copies of cycles. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:29-42 [Journal ] Nicolas Bonichon , Bertrand Le Saëc , Mohamed Mosbah Orthogonal drawings based on the stratification of planar graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:43-57 [Journal ] Endre Boros , Vladimir Gurvich , Roy Meshulam Difference graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:59-64 [Journal ] Roman Cada , Evelyne Flandrin , Hao Li , Zdenek Ryjácek Cycles through given vertices and closures. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:65-80 [Journal ] Gilles Caporossi , Pierre Hansen Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:81-94 [Journal ] Irène Charon , Iiro S. Honkala , Olivier Hudry , Antoine Lobstein The minimum density of an identifying code in the king lattice. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:95-109 [Journal ] Ernest J. Cockayne , Odile Favaron , Christina M. Mynhardt On i^{-} -ER-critical graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:111-125 [Journal ] Bruno Courcelle Clique-width of countable graphs: a compactness property. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:127-148 [Journal ] Charles Delorme Laplacian eigenvalues and fixed size multisection. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:149-159 [Journal ] Matt DeVos , Jaroslav Nesetril , André Raspaud Antisymmetric flows and edge-connectivity. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:161-167 [Journal ] Vladimir Dobrynin On the rank of a matrix associated with a graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:169-175 [Journal ] Hikoe Enomoto , Hao Li Partition of a graph into cycles and degenerated cycles. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:177-181 [Journal ] Reinhardt Euler Coloring planar Toeplitz graphs and the stable set polytope. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:183-200 [Journal ] Art S. Finbow , Bert Hartnell Well-located graphs: a collection of well-covered ones. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:201-209 [Journal ] Sylvain Gravier , Frédéric Maffray On the choice number of claw-free perfect graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:211-218 [Journal ] Harald Gropp "Réseaux réguliers" or regular graphs--Georges Brunel as a French pioneer in graph theory. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:219-227 [Journal ] Alain Guénoche , Bruno Leclerc , Vladimir Makarenkov On the extension of a partial metric to a tree metric. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:229-248 [Journal ] Glen-Brug Guenver , Jean-Xavier Rampon Split orders. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:249-267 [Journal ] Vladislav Kabanov , Igor Vakula The lower domination parameters in inflation of graphs of radius 1. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:269-272 [Journal ] Sònia P. Mansilla , Oriol Serra Automorphism groups of k-arc transitive covers. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:273-285 [Journal ] Jana Maxová , Jaroslav Nesetril On covers of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:287-294 [Journal ] Arnaud Pêcher Cayley partitionable graphs and near-factorizations of finite groups. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:295-311 [Journal ] Bert Randerath 3-Colorability and forbidden subgraphs. I: Characterizing pairs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:313-325 [Journal ] Jeremy Spinrad A note on computing graph closures. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:327-329 [Journal ] László A. Székely A successful concept for measuring non-planarity of graphs: the crossing number. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:331-352 [Journal ] Zoltán Szigeti On a min-max theorem on bipartite graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:353-361 [Journal ] Jean-Marie Vanherpe Clique-width of partner-limited graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:363-374 [Journal ] A. Pawel Wojda A condition for a graph to contain k -matching. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:375-378 [Journal ] Mariusz Wozniak Packing of graphs and permutations--a survey. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:379-391 [Journal ] Heping Zhang , Fuji Zhang , Haiyuan Yao Z -transformation graphs of perfect matchings of plane bipartite graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:393-404 [Journal ]