default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 171
Volume 171, Numbers 1-3, June 1997
- Ron Aharoni, Gabor T. Herman, Attila Kuba:
Binary vectors partially determined by linear equation systems. 1-16 - M. H. Armanious:
Construction of nilpotent sloops of class n. 17-25 - Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai:
LexBFS-orderings and powers of chordal graphs. 27-42 - Hajo Broersma
, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman:
Cycles through subsets with large degree sums. 43-54 - Darryn E. Bryant, Christopher A. Rodger, Erin R. Spicer:
Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14. 55-75 - Ilda P. F. da Silva:
Note on inseparability graphs of matroids having exactly one class of orientations. 77-87 - Tomás Dvorák, Ivan Havel, Petr Liebl:
Euler cycles in the complete graph K2m+1. 89-102 - Yoshimi Egawa:
Contractible cycles in graphs with large minimum degree. 103-119 - Robert Gardner, Biagio Micale, Mario Pennisi, Rebecca Zijlstra:
Cyclic and rotational hybrid triple systems. 121-139 - Johannes H. Hattingh, Elna Ungerer:
Minus k-subdomination in graphs II. 141-151 - Michal Karonski, Tomasz Luczak:
The number of connected sparsely edged uniform hypergraphs. 153-167 - Ru-Ying Liu, Lian-Chang Zhao:
A new method for proving chromatic uniqueness of graphs. 169-177 - Terry A. McKee:
Clique neighborhoods and nearly chordal graphs. 179-189 - Michel Minoux:
Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings. 191-200 - John Mitchem, Patrick Morriss:
On the cost-chromatic number of graphs. 201-211 - Irena Rusu:
Building counterexamples. 213-227 - Joseph M. Santmyer:
A stirling like sequence of rational numbers. 229-235 - Claude Tardif:
A fixed box theorem for the cartesian product of graphs and metric spaces. 237-248 - Ulrich Teschner:
New results about the bondage number of a graph. 249-259 - Peng-Jun Wan, Ding-Zhu Du, Ronald L. Graham:
The Steiner ratio for the dual normed plane. 261-275 - Peter Zörnig:
On the line graphs of the complete r-partite graphs. 277-282 - K. H. Chew:
On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs. 283-286 - Lane H. Clark, Dawit Haile:
Remarks on the size of critical edge-chromatic graphs. 287-293 - Dmitry Fon-Der-Flaass:
Arrays of distinct representatives - a very simple NP-complete problem. 295-298
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 2025-01-21 20:19 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:
