Journals in DBLP
F. Göbel , E. A. Neutel Cyclic Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Harald Gropp On some Infinite Series of (r, 1)-Designs. [Citation Graph (0, 0)][DBLP ] Journal ] Pavol Gvozdjak , Peter Horák , Mariusz Meszka , Zdzislaw Skupien On the Strong Chromatic Index of Cyclic Multigraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Magnús M. Halldórsson , Jan Kratochvíl , Jan Arne Telle Independent Sets with Domination Constraints. [Citation Graph (0, 0)][DBLP ] Journal ] Anja Hamacher , Winfried Hochstättler , Christoph Moll Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP ] Journal ] Andreas Huck Reducible Configurations for the Cycle Double Cover Conjecture. [Citation Graph (0, 0)][DBLP ] Journal ] Ekkehard Köhler Connected Domination and Dominating Clique in Trapezoid Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Dieter Kratsch Domination and Total Domination on Asteroidal Triple-free Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Ulrich Krüger Structural Aspects of Ordered Polymatroids. [Citation Graph (0, 0)][DBLP ] Journal ] Jan B. M. Melissen , P. C. Schuur Covering a Rectangle with Six and Seven Circles. [Citation Graph (0, 0)][DBLP ] Journal ] Markus Peter , Georg Wambach N-extendible Posets, and How to Minimize Total Weighted Completion Time. [Citation Graph (0, 0)][DBLP ] Journal ] Erich Prisner Recognizing k-path Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Anand Srivastav , Peter Stangier On Complexity, Representation and Approximation of Integral Multicommodity Flows. [Citation Graph (0, 0)][DBLP ] Journal ] Zsolt Tuza , Vitaly I. Voloshin Uncolorable Mixed Hypergraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Joost P. Warners , Hans van Maaren Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations. [Citation Graph (0, 0)][DBLP ] Journal ] Tianxing Yao , Yubao Guo , Kemin Zhang Pancyclic out-arcs of a Vertex in Tournaments. [Citation Graph (0, 0)][DBLP ] Journal ] Irmina A. Ziolo Subtrees of Bipartite Digraphs - The Minimum Degree Condition. [Citation Graph (0, 0)][DBLP ] Journal ] Eric Angel , Vassilis Zissimopoulos On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient. [Citation Graph (0, 0)][DBLP ] Journal ] Claudio Arbib , Michele Flammini , Enrico Nardelli How to Survive While Visiting a Graph. [Citation Graph (0, 0)][DBLP ] Journal ] Luitpold Babel Recognition and Isomorphism of Tree-like P4 -connected Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Douglas Bauer , Hajo Broersma , Henk Jan Veldman Not Every 2-tough Graph Is Hamiltonian. [Citation Graph (0, 0)][DBLP ] Journal ] Douglas Bauer , Gyula Y. Katona , Dieter Kratsch , Henk Jan Veldman Chordality and 2-factors in Tough Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Anton Betten , Gunnar Brinkmann , Tomaz Pisanski Counting Symmetric Configurations v3 . [Citation Graph (0, 0)][DBLP ] Journal ] Rodica Boliac , Dmitirii Lozovanu , D. Solomon Optimal Paths in Network Games with P Players. [Citation Graph (0, 0)][DBLP ] Journal ] Andreas Brandstädt , Van Bang Le Recognizing the P4 -structure of Block Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Hajo Broersma , Elias Dahlhaus , Ton Kloks A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Hans Georg Carstens , Thomas Dinski , Eckhard Steffen Reduction of Symmetric Configurations n3 . [Citation Graph (0, 0)][DBLP ] Journal ] Vladimir G. Deineko , Gerhard J. Woeginger The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices. [Citation Graph (0, 0)][DBLP ] Journal ] Feodor F. Dragan Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Katalin Friedl , Shi-Chun Tsai Two Results on the Bit Extraction Problem. [Citation Graph (0, 0)][DBLP ] Journal ] 