Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 95
Volume 95, Number 1-3, July 1999
- Rudolf Ahlswede, Zhen Zhang:
On Maximal Shadows of Members in Left-compressed Sets. 3-9 - Luitpold Babel, Stephan Olariu:
On the p-connectedness of Graphs - A Survey. 11-33 - Gunter Bär:
On the Complexity of Linear Programming in the BSS-model. 35-40 - Jørgen Bang-Jensen
, Gregory Z. Gutin:
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs. 41-60 - Jørgen Bang-Jensen, Yubao Guo, Anders Yeo:
A New Sufficient Condition for a Digraph to Be Hamiltonian. 61-72 - Frank E. Bennett:
A Brief Survey of Perfect Mendelsohn Packing and Covering Designs. 73-81 - Anton Betten, Dieter Betten:
The Proper Linear Spaces on 17 Points. 83-108 - Anton Betten, Reinhard Laue, Alfred Wassermann:
Simple 8-(40, 11, 1440) Designs. 109-114 - Christian Bey:
The Erdos-Ko-Rado Bound for the Function Lattice. 115-125 - Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder:
On k-partitioning of Hamming Graphs. 127-140 - Andreas Brandstädt, Van Bang Le:
Tree- and Forest-perfect Graphs. 141-162 - Andreas Brandstädt, Peter L. Hammer:
On the Stability Number of Claw-free P5-free and More General Graphs. 163-167 - E. Rodney Canfield, Konrad Engel:
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer. 169-180 - Serafino Cicerone, Gabriele Di Stefano:
On the Extension of Bipartite to Parity Graphs. 181-195 - Serafino Cicerone, Gabriele Di Stefano:
Graph Classes Between Parity and Distance-hereditary Graphs. 197-216 - Dietmar Cieslik:
The Steiner Ratio of lamdad2k. 217-221 - Feodor F. Dragan:
Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS. 223-239 - Fedor V. Fomin:
Note on a Helicopter Search Problem on Graphs. 241-249 - Martin Grüttmüller:
On the PBD-closure of Sets Containing 3. 251-272 - Yubao Guo:
Outpaths in Semicomplete Multipartite Digraphs. 273-277 - Heiko Harborth, Meinhard Möller:
Weakened Ramsey Numbers. 279-284 - Lawrence H. Harper:
On an Isoperimetric Problem for Hamming Graphs. 285-309 - Sven Hartmann:
Asymptotic Results on Suborthogonal "B"-decompositions of Complete Digraphs. 311-320 - Wilfried Imrich, Sandi Klavzar:
Recognizing Graphs of Acyclic Cubical Complexes. 321-330 - Dieter Jungnickel, Alexander Pott:
Perfect and Almost Perfect Sequences. 331-359 - Gholamreza B. Khosrovshahi, Hamid Reza Maimani, Rouzbeh Torabi:
On Trades: An Update. 361-376 - Uwe Leck, Volker Leck:
Orthogonal Double Covers of Complete Graphs by Trees of Small Diameter. 377-388 - Ali Ridha Mahjoub, Charles Nocq:
On the Linear Relaxation of the 2-node Connected Subgraph Polytope. 389-416 - Ingrid Mengersen, Jörg Oeckermann:
Matching-star Ramsey Sets. 417-424 - Kari J. Nurmela, Patric R. J. Östergård:
Covering t-sets with (t+2)-sets. 425-437 - Ulrike Schumacher:
Suborthogonal Double Covers of the Complete Graph by Stars. 439-444 - Peter Tittmann:
Partitions and Network Reliability. 445-453 - Annegret Wagler:
Critical Edges in Perfect Line Graphs and some Polyhedral Consequences. 455-466
a service of 
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-04-15 21:38 CEST 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:
