Journals in DBLP
Jaroslav Nesetril , Martin Bálek Preface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:1969-1971 [Journal ] Alexandre Tiskin Packing tripods: Narrowing the density gap. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:1973-1981 [Journal ] Tomás Dvorák , Petr Gregor Hamiltonian paths with prescribed edges in hypercubes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:1982-1998 [Journal ] Sul-Young Choi , Puhua Guan Construction of a family of graphs with a small induced proper subgraph with minimum degree 3. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:1999-2001 [Journal ] Marek Janata About a new class of matroid-inducing packing families. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2002-2007 [Journal ] Yon Dourisboure , Cyril Gavoille Tree-decompositions with bags of small diameter. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2008-2029 [Journal ] Michel Habib , David Kelly , Emmanuelle Lebhar , Christophe Paul Can transitive orientation make sandwich problems easier? [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2030-2041 [Journal ] Janka Chlebíková , Klaus Jansen The d-precoloring problem for k-degenerate graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2042-2052 [Journal ] Rostislav Caha , Václav Koubek Spanning multi-paths in hypercubes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2053-2066 [Journal ] Ladislav Nebesky The interval function of a connected graph and road systems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2067-2073 [Journal ] Eyal Beigman Extension of Arrow's theorem to symmetric sets of tournaments. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2074-2081 [Journal ] Josep Díaz , Maria J. Serna , Dimitrios M. Thilikos Complexity issues on bounded restrictive H-coloring. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2082-2093 [Journal ] Stephen Finbow , Andrew King , Gary MacGillivray , Romeo Rizzi The firefighter problem for graphs of maximum degree three. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2094-2105 [Journal ] Yared Nigussie Algorithm for finding structures and obstructions of tree ideals. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2106-2111 [Journal ] D. Gonçalves Caterpillar arboricity of planar graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2112-2121 [Journal ] Susumu Suzuki , Toshihide Ibaraki The complexity of assigning genotypes to people in a pedigree consistently. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2122-2131 [Journal ] Guillaume Fertin , André Raspaud L(p, q) labeling of d-dimensional grids. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2132-2140 [Journal ] Fabrice Bazzaro , Mickaël Montassier , André Raspaud (d, 1)-total labelling of planar graphs with large girth and high maximum degree. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2141-2151 [Journal ]