Journals in DBLP
Claudio Arbib , Michele Flammini On the upper chromatic number of (v3 , b2 )-configurations. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:3-12 [Journal ] Douglas Bauer , Hajo Broersma , Aurora Morgana , Edward F. Schmeichel Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:13-23 [Journal ] Stephan Brandt Triangle-free graphs and forbidden subgraphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:25-33 [Journal ] Hajo Broersma , Liming Xiong A note on minimum degree conditions for supereulerian graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:35-43 [Journal ] Hajo Broersma , Xueliang Li Some approaches to a conjecture on short cycles in digraphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:45-53 [Journal ] Gerard J. Chang , Sheng-Chyang Liaw , Hong-Gwa Yeh k-Subdomination in graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:55-60 [Journal ] Janka Chlebíková The structure of obstructions to treewidth and pathwidth. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:61-71 [Journal ] Giuseppe Confessore , Paolo Dell'Olmo , Stefano Giordani An approximation result for the interval coloring problem on claw-free chordal graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:73-90 [Journal ] Celina M. Herrera de Figueiredo , John G. Gimbel , Célia Picinin de Mello , Jayme Luiz Szwarcfiter A note on transitive orientations with maximum sets of sources and sinks. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:91-95 [Journal ] Miranca Fischermann , Lutz Volkmann Graphs having distance-n domination number half their order. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:97-107 [Journal ] Yubao Guo , Jin Ho Kwak The cycle structure of regular multipartite tournaments. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:109-116 [Journal ] Thomas Harmuth An inductive definition of cubic toroidal maps. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:117-140 [Journal ] Sandi Klavzar , Uros Milutinovic , Ciril Petr On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:141-157 [Journal ] Masataka Nakamura A single-element extension of antimatroids. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:159-164 [Journal ] Stavros D. Nikolopoulos Coloring permutation graphs in parallel. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:165-195 [Journal ] Patric R. J. Östergård A fast algorithm for the maximum clique problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:197-207 [Journal ] Artem V. Pyatkin The incidentor coloring of multigraphs and its applications. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:209-217 [Journal ] Bert Randerath , Ingo Schiermeyer , Meike Tewes , Lutz Volkmann Vertex pancyclic graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:219-237 [Journal ] Meike Tewes Pancyclic orderings of in-tournaments. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:239-249 [Journal ] Hein van der Holst , José Coelho de Pina Length-bounded disjoint paths in planar graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:251-261 [Journal ] Hansjoachim Walther Polyhedral graphs with extreme numbers of types of faces. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:263-274 [Journal ] Blaz Zmazek , Janez Zerovnik Algorithm for recognizing Cartesian graph bundles. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:275-302 [Journal ]