![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Discrete Applied Mathematics, Volume 44
Volume 44, Numbers 1-3, 1993
- Martin Charles Golumbic, Renu C. Laskar:
Introduction. Discret. Appl. Math. 44(1-3): 1-3 (1993) - Pavol Hell:
Biography of Martin Farber, 1951-1989. 5-7 - Hans-Jürgen Bandelt, Martin Farber, Pavol Hell:
Absolute Reflexive Retracts and Absolute Bipartite Retracts. 9-20 - Ilan Adler, Alan J. Hoffman, Ron Shamir
:
Monge and Feasibility Sequences in General Flow Problems. 21-38 - Vasek Chvátal:
Which Claw-Free Graphs are Perfectly Orderable? 39-63 - Ehab S. Elmallah, Lorna K. Stewart:
Independence and domination in Polygon Graphs. 65-77 - Martin Charles Golumbic, Renu C. Laskar:
Irredundancy in Circular Arc Graphs. 79-89 - Michael S. Jacobson, Kenneth Peters:
A Note on Graphs Which Have Upper Irredundance Equal to Independence. 91-97 - Philip J. Bernhard
, Stephen T. Hedetniemi, David Pokrass Jacobs:
Efficient Sets in Graphs. 99-108 - Jan Arne Telle, Andrzej Proskurowski:
Efficient Sets in Partial k-Trees. 109-117 - Jean R. S. Blair:
The Efficiency of AC Graphs. 119-138 - Leizhen Cai, Frédéric Maffray:
On the SPANNING k-Tree Problem. 139-156 - Garth Isaak:
Bounded Discrete Representations of Interval Orders. 157-183 - Srinivasa Rao Arikati, Uri N. Peled:
A Linear Algorithm for the Group Path Problem on Chordal Graphs. 185-190 - Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
Ø-Threshold and Ø-Tolerance Chain Graphs. 191-203 - Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West:
Subtree and Substar Intersection Numbers. 205-220 - Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner:
Computing Residual Connectedness Reliability for Restricted Networks. 221-232 - Edward R. Scheinerman, Ann N. Trenk:
On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection. 233-245 - Richard P. Anstee:
Minimum Vertex Weighted Deficiency of (g, f)-Factors: A Greedy Algorithm. 247-260 - Peter C. Fishburn, Fred S. Roberts
:
Elemantary Sequences, Sub-Fibonacci Sequences. 261-281 - Hans Jürgen Prömel, Angelika Steger:
Excluding Induced Subgraphs II: Extremal Graphs. 283-294 - Teresa W. Haynes, Robert C. Brigham, Ronald D. Dutton:
Extremal Graphs Domination Insensitive to the Removal of k Edges. 295-304 - Alan Hartman
, Yoav Medan:
Covering the Complete Graph with Plane Cycles. 305-310
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.