default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 79
Volume 79, Number 1-3, November 1997
- Ulrich Faigle, Kees Hoede:
Preface. 1 - Thomas Andreae, Martin Hintz, Michael Nölle, Gerald Schreiber, Gerald W. Schuster, Hajo Seng:
Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three. 3-34 - Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel:
The Complexity of Recognizing Tough Cubic Graphs. 35-44 - Hans L. Bodlaender, Dimitrios M. Thilikos:
Treewidth for Graphs with Small Chordality. 45-61 - Stephan Brandt:
A Sufficient Condition for All Short Cycles. 63-66 - Min-Jen Jou, Gerard J. Chang:
Maximal Independent Sets in Graphs with at Most One Cycle. 67-73 - Elias Dahlhaus, Jan Kratochvíl
, Paul D. Manuel, Mirka Miller:
Transversal Partitioning in Balanced Hypergraphs. 75-89 - Peter Dankelmann, Henda C. Swart, Ortrud Oellermann:
On the Average Steiner Distance of Graphs with Prescribed Properties. 91-103 - Theo S. H. Driessen:
Tree Enterprises and Bankruptcy Ventures a Game Theoretic Similarity Due to a Graph Theoretic Proof. 105-117 - Yubao Guo:
Spanning Local Tournaments in Locally Semicomplete Digraphs. 119-125 - Yubao Guo, Lutz Volkmann:
Bypaths in Tournaments. 127-135 - Anuj Mehrotra:
Cardinality Constrained Boolean Quadratic Polytope. 137-154 - Thomas Niessen:
Optimal Channel Allocation for Several Types of Cellular Radio Networks. 155-170 - Andreas Parra, Petra Scheffler:
Characterizations and Algorithmic Applications of Chordal Graph Embeddings. 171-188 - Annette Schelten, Ingo Schiermeyer:
Ramsey Numbers r(K3, G) for Connected Graphs G of Order Seven. 189-200 - Uwe Schelten, Ingo Schiermeyer:
Small Cycles in Hamiltonian Graphs. 201-211 - Rainer Schrader, Georg Wambach:
The Setup Polyhedron of Series-parallel Posets. 213-221 - Anand Srivastav, Peter Stangier:
Tight Approximations for Resource Constrained Scheduling and Bin Packing. 223-245 - Zsolt Tuza, Margit Voigt:
List Colorings and Reducibility. 247-256 - Hansjoachim Walther:
Polyhedral Graphs Without Hamiltonian Cycles. 257-263 - P. Wittmann:
Vertex-distinguishing Edge-colorings of 2-regular Graphs. 265-277 - A. Pawel Wojda, Malgorzata Zwonek:
Coloring Edges of Self-complementary Graphs. 279-284
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-30 19:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
